Deciding bisimilarity is P-complete
Document typeExternal research report
Rights accessOpen Access
On finite labelled transition systems, the problems of deciding strong bisimilarity, observation equivalence, and observation congruence are P-complete under many-one NC-reducibility. As a consequence, algorithms for automated analysis of finite state systems based on bisimulation seem to be inherently sequential in the following sense: the design of an efficient parallel algorithm to solve any of these problems will require an exceedingly hard algorithmic breakthrough.
CitationBalcazar, J.L.; Gabarro, J.; Santha, M. Deciding bisimilarity is P-complete. 1990.
Is part ofLSI-90-25