Branching Bisimilarity between Finite-State Systems and BPA or Normed BPP Is Polynomial-Time Decidable

In this paper we present polynomial time algorithms deciding branching bisimilarity between finite-state systems and several classes of infinite-state systems: BPA and normed BPP. The algorithm for BPA improves a previous one given by Ku***era and Mayr, while the one for normed BPP demonstrates the polynomial-time decidability of the problem, which is unknown previously. The proof style follows an early work of Ku***era and Mayr, where similar results for weak bisimilarity are established.

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

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

[3]  Hans Hüttel,et al.  Silence is Golden: Branching Bisimilarity is Decidable for Context-Free Processes , 1991, CAV.

[4]  Jan Friso Groote,et al.  An Efficient Algorithm for Branching Bisimulation and Stuttering Equivalence , 1990, ICALP.

[5]  Vojtech Rehák,et al.  Reachability of Hennessy-Milner Properties for Weakly Extended PRS , 2005, FSTTCS.

[6]  Jirí Srba,et al.  Roadmap of Infinite Results , 2002, Bull. EATCS.

[7]  Jirí Srba.  Strong Bisimilarity and Regularity of Basic Process Algebra Is PSPACE-Hard , 2002, ICALP.

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

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

[10]  Norbert Blum,et al.  Greibach Normal Form Transformation Revisited , 1999, Inf. Comput..

[11]  Jirí Srba,et al.  Strong Bisimilarity and Regularity of Basic Parallel Processes Is PSPACE-Hard , 2002, STACS.

[12]  Rob J. van Glabbeek,et al.  Branching time and abstraction in bisimulation semantics , 1996, JACM.

[13]  Faron Moller,et al.  Verification on Infinite Structures , 2001, Handbook of Process Algebra.

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

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

[16]  Sundar Sarukkai,et al.  FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science, 25th International Conference, Hyderabad, India, December 15-18, 2005, Proceedings , 2005, FSTTCS.

[17]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

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

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

[20]  守屋 悦朗,et al.  J.E.Hopcroft, J.D. Ullman 著, "Introduction to Automata Theory, Languages, and Computation", Addison-Wesley, A5変形版, X+418, \6,670, 1979 , 1980 .

[21]  Christos H. Papadimitriou,et al.  Elements of the Theory of Computation , 1997, SIGA.

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

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

[24]  Richard Mayr.  Decidability of model checking with the temporal logic EF , 2001, Theor. Comput. Sci..

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

[26]  Antonín Kucera,et al.  Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time , 2002, Theor. Comput. Sci..

[27]  Jos C. M. Baeten,et al.  Process Algebra , 2007, Handbook of Dynamic System Modeling.

[28]  Petr Jancar,et al.  Strong bisimilarity on basic parallel processes in PSPACE-complete , 2003, 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings..