Weak Bisimilarity with Infinite-State Systems Can Be Decided in Polynomial Time

We prove that weak bisimilarity is decidable in polynomial time between BPA and finite-state processes, and between normed BPP and finite-state processes.To the best of our knowledge, these are the first polynomial algorithms for weak bisimilarity with infinite-state systems.

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

[2]  Aaas News,et al.  Book Reviews , 1893, Buffalo Medical and Surgical Journal.

[3]  Richard Mayr.  Strict Lower Bounds for Model Checking BPA , 1998, Electron. Notes Theor. Comput. Sci..

[4]  Jan Friso Groote,et al.  A Short Proof of the Decidability of Bisimulation for Normed BPA-Processes , 1992, Inf. Process. Lett..

[5]  Javier Esparza,et al.  Reachability Analysis of Pushdown Automata: Application to Model-Checking , 1997, CONCUR.

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

[7]  Faron Moller,et al.  Decomposability, decidability and axiomatisability for bisimulation equivalence on basic parallel processes , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.

[8]  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.

[9]  Richard Mayr.  Weak Bisimulation and Model Checking for Basic Parallel Processes , 1996, FSTTCS.

[10]  M. W. Shields.  An Introduction to Automata Theory , 1988 .

[11]  Ivana Cerná,et al.  Bisimilarity is decidable in the union of normed BPA and normed BPP processes , 1996, INFINITY.

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

[13]  Ivana Cerná,et al.  Comparing expressibility of normed BPA and normed BPP processes , 1999, Acta Informatica.

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

[15]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[16]  Antonín Kucera,et al.  Effective decomposability of sequential behaviours , 2000, Theor. Comput. Sci..

[17]  Jitka StříAbrná.  Hardness results for weak bisimilarity of simple process algebras , 1998 .

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

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

[20]  Javier Esparza,et al.  Decidability of model checking for infinite-state concurrent systems , 1997, Acta Informatica.

[21]  Jens Knoop,et al.  An Automata-Theoretic Approach to Interprocedural Data-Flow Analysis , 1999, FoSSaCS.

[22]  James L. Peterson,et al.  Petri Nets , 1977, CSUR.

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

[24]  Hans Hüttel,et al.  Actions Speak Louder Than Words: Proving Bisimilarity for Context-Free Processes , 1998, J. Log. Comput..

[25]  Richard Mayr,et al.  Process rewrite systems , 1999, EXPRESS.

[26]  Javier Esparza,et al.  More infinite results , 2001, INFINITY.

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

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

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

[30]  Antonín Kucera,et al.  Simulation Preorder on Simple Process Algebras , 1999, ICALP.

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

[32]  Jitka Stríbrná.  Hardness results for weak bisimilarity of simple process algebras , 1998, Electron. Notes Theor. Comput. Sci..

[33]  Didier Caucal,et al.  Graphes canoniques de graphes algébriques , 1990, RAIRO Theor. Informatics Appl..

[34]  Hans Hüttel,et al.  Actions speak louder than words: proving bisimilarity for context-free processes , 1991, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science.

[35]  David Park,et al.  Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.

[36]  Javier Esparza.  Petri Nets, Commutative Context-Free Grammars, and Basic Parallel Processes , 1995, FCT.

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