Abstract
Basic Parallel Processes (BPP) are a natural subclass of CCS infinite-state processes. They are also equivalent to a special class of Petri nets. We show that unlike for general Petri nets, it is decidable if a BPP and a finite-state system are weakly bisimilar. To the best of our knowledge, this is the first decidability result for weak bisimulation and a non-trivial class of infinite-state systems. We also show that the model checking problem for BPPs and the branching time logic UB− is PSPACE-complete. This settles a conjecture of [4].
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
