A Polynomial Algorithm for Deciding Bisimilarity of Normed Context-Free Processes

The previous best upper bound on the complexity of deciding bisimilarity between normed context-free processes, due to Huynh and Tian, is that the problem lies in the second level of the polynomial hierarchy: their algorithm guesses a proof of equivalence and validates this proof in polynomial time using oracles freely answering questions which are in NP. In this paper we improve on this result by presenting a polynomial-time algorithm which solves this problem. As a corollary, we have a polynomial algorithm for the equivalence problem for simple context-free grammars.

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

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

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

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

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

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

[7]  Grzegorz Rozenberg,et al.  Developmental systems and languages , 1972, STOC.

[8]  C. A. R. Hoare,et al.  Communicating Sequential Processes (Reprint) , 1983, Commun. ACM.

[9]  Lu Tian,et al.  Deciding Bisimilarity of Normed Context-Free Processes is in Sigma^p_2 , 1994, Theor. Comput. Sci..

[10]  Jan Friso Groote,et al.  Undecidable Equivalences for Basic Process Algebra , 1994, Inf. Comput..

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

[12]  Petr Jancar,et al.  Decidability Questions for Bismilarity of Petri Nets and Some Related Problems , 1994, STACS.

[13]  Donald E. Knuth,et al.  Fast Pattern Matching in Strings , 1977, SIAM J. Comput..

[14]  Jan A. Bergstra,et al.  Algebra of Communicating Processes with Abstraction , 1985, Theor. Comput. Sci..

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

[16]  John E. Hopcroft,et al.  Simple Deterministic Languages , 1966, SWAT.

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

[18]  Faron Moller,et al.  A Fast Algorithm for Deciding Bisimilarity of Normed Context-Free Processes , 1994, CONCUR.

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

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

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

[22]  Didier Caucal.  A Fast Algorithm to Decide on the Equivalence of Stateless DPDA , 1993, RAIRO Theor. Informatics Appl..

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

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

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

[26]  Larry J. Stockmeyer,et al.  The Polynomial-Time Hierarchy , 1976, Theor. Comput. Sci..

[27]  Søren Christensen,et al.  Bisimulation Equivalence is Decidable for Context-Free Processes , 2005 .