We show that the problem of checking whether two processes definable in the syntax of Basic Parallel Processes (BPP) are strongly bisimilar is PSPACE-hard. We also demonstrate that there is a polynomial time reduction from the strong bisimilarity checking problem of regular BPP to the strong regularity (finiteness) checking of BPP. This implies that strong regularity of BPP is also PSPACE-hard.
CITATION STYLE
Srba, J. (2002). Strong bisimilarity and regularity of basic parallel processes is PSPACE-hard. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2285, pp. 535–546). Springer Verlag. https://doi.org/10.1007/3-540-45841-7_44
Mendeley helps you to discover research relevant for your work.