A polynomial algorithm for deciding bisimilarity of normed context-free processes

Theoretical Computer Science

Volumn 158, Issue 1-2, 1996, Pages 143-159

  Hirshfeld, Yoram ^a   Jerrum, Mark ^a   Moller, Faron ^a,b  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

^b SWEDISH INSTITUTE OF COMPUTER SCIENCE   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; COMPUTATIONAL COMPLEXITY; CONTEXT FREE GRAMMARS; EQUIVALENCE CLASSES; POLYNOMIALS; PROBLEM SOLVING; THEOREM PROVING;

DECIDING BISIMILARITY; NORMED CONTEXT FREE PROCESSES; POLYNOMIAL ALGORITHMS;

ALGORITHMS;

EID: 0030145876     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(95)00064-X     Document Type: Article

References (19)

1. J.C.M. Baeten, J.A. Bergstra and J.W. Klop, Decidability of bisimulation equivalence for processes generating context-free languages, J. ACM 40(3) (1993) 653-682.
2. J.A. Bergstra and J.W. Klop, Algebra of communicating processes with abstraction, Theoret. Comput. Sci. 37(1) (1985) 77-121.
3. D. Caucal, Graphes canoniques des graphes algébriques, Inform. Théori. Appl. (RAIRO) 24(4) (1990) 339-352.
4. D. Caucal, A fast algorithm to decide on the equivalence of stateless DPDA, Inform. Théori. Appl. (RAIRO) 27(1) (1993) 23-48.
5. S. Christensen, H. Hüttel and C. Stirling, Bisimulation equivalence is decidable for all context-free processes, in: W.R. Cleaveland, ed., Proc. CONCUR 92, Lecture Notes in Computer Science, Vol. 630 (Springer, Berlin, 1992) 138-147.
6. G.T. Herman and G. Rozenberg, Developmental Systems and Languages (North-Holland, Amsterdam, 1975).
7. Y. Hirshfeld and F. Moller, A fast algorithm for deciding bisimilarity of normed context-free processes, in: B. Jonsson and J. Parrow, eds., Proc. CONCUR 94, Lecture Notes in Computer Science, Vol. 836 (Springer, Berlin, 1994) 48-63.
8. Y. Hirshfeld, M. Jerrum and F. Moller, A polynomial algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes, Report ECS-LFCS-94-288, Department of Computer Science, University of Edinburgh, March 1994.
9. C.A.R. Hoare, Communicating Sequential Processes (Prentice Hall, Englewood Cliffs, NJ, 1985).
10. J.E. Hopcroft and J.D. Ullman, Introduction to Automata Theory, Languages and Computation (Addison-Wesley, Reading, MA, 1979).
11. 2, Theoret. Comput. Sci. 123(2) (1994) 183-197.
12. P. Jančar, Decidability questions for bisimilarity of Petri nets and some related problems, in: P. Enjalbert, E.W. Mayr and K.W. Wagner, eds., Proc. STACS 94, Lecture Notes in Computer Science, Vol. 775 (Springer, Berlin, 1994) 581-592.
13. D.E. Knuth, J.H. Morris and V.R. Pratt, Fast pattern matching in strings, SIAM J. Comput. 6(2) (1977) 323-350.
14. A. Korenjak and J. Hopcroft, Simple deterministic languages, Proc. 7th IEEE Switching and Automata Theory Conf. (IEEE Press, New York, 1966) 36-46.
15. R. Mimer, Communication and Concurrency (Prentice Hall, Englewood Cliffs, NJ 1989).
16. R. Milner and F. Moller, Unique decomposition of processes, J. Theoret. Comput. Sci. 107 (1993) 357-363.
17. D.M.R. Park, Concurrency and Automata on Infinite Sequences, in: P. Deussen, ed., Proc. 5th G.I. Conf. on Theoretical Computer Science, Lecture Notes in Computer Science, Vol. 104 (Springer, Berlin, 1981) 168-183.
18. L.J. Stockmeyer, The polynomial time hierarchy, Theoret. Comput. Sci. 3(1) (1977) 1-22.
19. R.J. van Glabbeek, The linear time-branching time spectrum, in: J. Baeten and J.W. Klop, eds., proc. CONCUR 90, Lecture Notes in Computer Science, Vol. 458 (Springer, Berlin, 1990) 278-297.