Abstract.
We study bisimilarity and regularity problems of simple process algebras. In particular, we show PSPACE-hardness of the following problems: (i) strong bisimilarity of Basic Parallel Processes (BPP), (ii) strong bisimilarity of Basic Process Algebra (BPA), (iii) strong regularity of BPP, and (iv) strong regularity of BPA. We also demonstrate NL-hardness of strong regularity problems for the normed subclasses of BPP and BPA.
Bisimilarity problems of 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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: 10 May 2002 / 14 February 2003
RID="*"
ID="*" The work reported here is a revised and extended version of [30] and [31], and has been done while the author was a graduate student at BRICS, Department of Computer Science, University of Aarhus, Denmark.
RID="*"
ID="*" The author is supported in part by the GACR, grant No. 201/03/1161.
Rights and permissions
About this article
Cite this article
Srba, J. Strong bisimilarity of simple process algebras: complexity lower bounds. Acta Informatica 39, 469–499 (2003). https://doi.org/10.1007/s00236-003-0116-9
Issue Date:
DOI: https://doi.org/10.1007/s00236-003-0116-9