Strong bisimilarity of Basic Parallel Processes (BPP) is decidable, but the best known algorithm has non-elementary complexity [7]. On the other hand, no lower bound for the problem was known. We show that strong bisimilarity of BPP is co-NP-hard. Weak bisimilarity of BPP is not known to be decidable, but an NP lower bound has been shown in [31].We improve this result by showing that weak bisimilarity of BPP is Πp2 -hard. Finally, we show that the problems if a BPP is regular (i.e., finite) w.r.t. strong and weak bisimilarity are co-NP-hard and Πp2 -hard, respectively.
CITATION STYLE
Mayr, R. (2000). On the complexity of bisimulation problems for basic parallel processes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1853, pp. 329–341). Springer Verlag. https://doi.org/10.1007/3-540-45022-x_29
Mendeley helps you to discover research relevant for your work.