Abstract
In this paper we study bisimilarity problems for simple process algebras. In particular, we show PSPACE-hardness of the following problems:<ol><li>strong bisimilarity of Basic Parallel Processes (BPP),</li><li>strong bisimilarity of Basic Process Algebra (BPA),</li><li>strong regularity of BPP, and</li><li>strong regularity of BPA.</li></ol>We also demonstrate NL-hardness of strong regularity problems for the normed subclasses of BPP and BPA.<br /> <br />Bisimilarity problems for simple process algebras are introduced in a general framework of process rewrite systems, and a uniform description of the new techniques used for the hardness proofs is provided.
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 call
