Hardness of equivalence checking for composed finite-state systems

Computational complexity of comparing behaviours of systems composed from interacting finite-state components is considered. The main result shows that the respective problems are EXPTIME-hard for all relations between bisimulation equivalence and trace preorder, as conjectured by Rabinovich (Inf Comput 139(2):111–129, 1997). The result is proved for a specific model of parallel compositions where the components synchronize on shared actions but it can be easily extended to other similar models,   to labelled 1-safe Petri nets. Further hardness results are shown for special cases of acyclic systems.

[1]  Anthony Mansfield,et al.  On the computational complexity of a merge recognition problem , 1983, Discret. Appl. Math..

[2]  José L. Balcázar,et al.  Deciding Bisimilarity is P-Complete , 1992, Formal Aspects Comput..

[3]  David Haussler,et al.  On the Complexity of Iterated Shuffle , 1984, J. Comput. Syst. Sci..

[4]  Albert R. Meyer,et al.  The Equivalence Problem for Regular Expressions with Squaring Requires Exponential Space , 1972, SWAT.

[5]  J. Bergstra,et al.  Handbook of Process Algebra , 2001 .

[6]  Antti Valmari,et al.  Alphabet-Based Synchronisation is Exponentially Cheaper , 2002, CONCUR.

[7]  Neil Immerman,et al.  Descriptive Complexity , 1999, Graduate Texts in Computer Science.

[8]  Scott A. Smolka,et al.  CCS expressions, finite state processes, and three problems of equivalence , 1983, PODC '83.

[9]  Rob van Glabbeek,et al.  Handbook of Process Algebra , 2001 .

[10]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[11]  Sandeep K. Shukla,et al.  On the Complexity of Relational Problems for Finite State Processes (Extended Abstract) , 1996, ICALP.

[12]  Jirí Srba,et al.  Undecidability of bisimilarity by defender's forcing , 2008, JACM.

[13]  Neil Immerman,et al.  Descriptive Complexity and Model Checking , 1998, FSTTCS.

[14]  Alexander Moshe Rabinovich,et al.  Complexity of Equivalence Problems for Concurrent Systems of Finite Agents , 1997, Inf. Comput..

[15]  Zdenek Sawa.  Equivalence Checking of Non-Flat Systems Is EXPTIME-hard , 2003, CONCUR.

[16]  J. Gabarró,et al.  Deciding bisimilarity isP-complete , 1992, Formal Aspects of Computing.

[17]  Rob J. van Glabbeek,et al.  The Linear Time - Branching Time Spectrum II , 1993, CONCUR.

[18]  Petr Jancar,et al.  Behavioural Equivalences on Finite-State Systems are PTIME-hard , 2005, Comput. Artif. Intell..

[19]  Faron Moller,et al.  Verification of Parallel Systems via Decomposition , 1992, CONCUR.

[20]  Robert E. Tarjan,et al.  Three Partition Refinement Algorithms , 1987, SIAM J. Comput..

[21]  Philippe Schnoebelen,et al.  The State Explosion Problem from Trace to Bisimulation Equivalence , 2000, FoSSaCS.

[22]  R. J. vanGlabbeek.  The linear time - branching time spectrum , 1990 .