Techniques for Decidability and Undecidability of Bisimilarity

In this tutorial we describe general approaches to deciding bisimilarity between vertices of (infinite) directed edge-labelled graphs. The approaches are based on a systematic search following the definition of bisimilarity. We outline (in decreasing levels of detail) how the search is modified to solve the problem for finite graphs, BPP graphs, BPA graphs, normed PA graphs, and normed PDA graphs. We complete this by showing the technique used in the case of graphs generated by one-counter machines. Finally, we demonstrate a general reduction strategy for proving undecidability, which we apply in the case of graphs generated by state-extended BPP (a restricted form of labelled Petri nets).

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

[2]  Yoram Hirshfeld,et al.  Bisimulation trees and the decidability of weak bisimulations , 1996, INFINITY.

[3]  L. Dickson.  Finiteness of the Odd Perfect and Primitive Abundant Numbers with n Distinct Prime Factors , 1913 .

[4]  Antonín Kucera,et al.  Deciding bisimulation-like equivalences with finite-state processes , 2001, Theor. Comput. Sci..

[5]  Unique decomposition of processes , 1990, Bull. EATCS.

[6]  Faron Moller,et al.  A polynomial-time algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes , 1994, Mathematical Structures in Computer Science.

[7]  Faron Moller,et al.  A polynomial-time algorithm for deciding equivalence of normed context-free processes , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[8]  Marvin Minsky,et al.  Computation : finite and infinite machines , 2016 .

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

[10]  Søren Christensen,et al.  Bisimulation Equivalence is Decidable for all Context-Free Processes , 2022 .

[11]  Faron Moller,et al.  Infinite Results , 1996, CONCUR.

[12]  Faron Moller,et al.  Simulation of One-Counter Nets via Colouring , 1999 .

[13]  Bernhard Steffen,et al.  An Elementary Bisimulation Decision Procedure for Arbitrary Context-Free Processes , 1995, MFCS.

[14]  Petr Jancar.  Undecidability of Bisimilarity for Petri Nets and Some Related Problems , 1995, Theor. Comput. Sci..

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

[16]  Jan A. Bergstra,et al.  Decidability of Bisimulation Equivalence for Processes Generating Context-Free Languages , 1987, PARLE.

[17]  Jan A. Bergstra,et al.  Decidability of bisimulation equivalence for process generating context-free languages , 1987, JACM.

[18]  Faron Moller,et al.  Petri Nets and Regular Processes , 1999, J. Comput. Syst. Sci..

[19]  Petr Jancar,et al.  Bisimulation Equivalence is Decidable for One-Counter Processes , 1997, ICALP.

[20]  Ernst W. Mayr.  An Algorithm for the General Petri Net Reachability Problem , 1984, SIAM J. Comput..

[21]  Colin Stirling,et al.  Decidability of bisimulation equivalence for normed pushdown processes , 1998, SIGA.

[22]  M. Schützenberger,et al.  Rational sets in commutative monoids , 1969 .

[23]  Richard Mayr,et al.  Deciding Bisimulation-Like Equivalences with Finite-State Processes , 1998, ICALP.

[24]  L. Rédei,et al.  The theory of finitely generated commutative semigroups , 1965 .

[25]  Faron Moller,et al.  A Polynomial Algorithm for Deciding Bisimilarity of Normed Context-Free Processes , 1994, Theor. Comput. Sci..

[26]  Faron Moller,et al.  Bisimulation Equivalence is Decidable for Basic Parallel Processes , 1993, CONCUR.

[27]  Mark Jerrum,et al.  Bisimulation Equivanlence Is Decidable for Normed Process Algebra , 1999 .

[28]  Derek C. Oppen,et al.  A 2^2^2^pn Upper Bound on the Complexity of Presburger Arithmetic , 1978, J. Comput. Syst. Sci..

[29]  A. Meyer,et al.  The complexity of the word problems for commutative semigroups and polynomial ideals , 1982 .

[30]  Géraud Sénizergues,et al.  The Equivalence Problem for Deterministic Pushdown Automata is Decidable , 1997, ICALP.