Decidability of bisimulation equivalence for normed pushdown processes

Theoretical Computer Science

Volumn 195, Issue 2, 1998, Pages 113-131

  Stirling, Colin ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

Bisimulation equivalence; Decidability; Infinite state systems; Pushdown process

Indexed keywords

EID: 0000320689     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(97)00216-8     Document Type: Article

References (27)

1. J. Baeten, J. Bergstra, Recursive process definitions with the state operator, Theoret. Comput. Sci. 82 (1991) 285-302.
2. J. Baeten, J. Bergstra, J. Klop, Decidability of bisimulation equivalence for processes generating context-free languages, Lecture Notes in Computer Science, vol. 259, Springer, Berlin, 1987, pp. 94-113.
3. J. Baeten, J. Bergstra, J. Klop, Decidability of bisimulation equivalence for processes generating context-free languages, J. Assoc. Comput. Machinery 40 (1993) 653-682.
4. O. Burkart, D. Caucal, B. Steffen, An elementary decision procedure for arbitrary context-free processes, Tech. Report 94-28, RWTH Aachen, 1994 (extended version of Lecture Notes in Computer Science, vol. 969, pp. 423-433).
5. O. Burkart, D. Caucal, B. Steffen, Bisimulation collapse and the process taxonomy, Lecture Notes in Computer Science, vol. 1119, Springer, Berlin, 1996, pp. 247-262.
6. O. Burkart, B. Steffen, Composition, decomposition, and model checking of pushdown processes, Nordic J. Comput. 2 (1995) 89-125.
7. D. Caucal, Graphes canoniques de graphes algébriques. Informatique Théorique Appl. (RAIRO) 24 (1990) 339-352.
8. D. Caucal, On the regular structure of prefix rewriting, Theoret. Comput. Sci. 106 (1992) 61-86.
9. D. Caucal, Bisimulation of context-free grammars and of pushdown automata, CSLI Lecture Notes, vol. 53, 1995, pp. 85-106.
10. D. Caucal, On infinite transition graphs having a decidable monadic theory, Lecture Notes in Computer Science, vol. 1099, Springer, Berlin, 1996, pp. 194-205.
11. D. Caucal, R. Monfort, On the transition graphs of automata and grammars, Lecture Notes in Computer Science, vol. 484, Springer, Berlin, 1990, pp. 311-337.
12. S. Christensen, Y. Hirshfeld, F. Moller, Decomposability, decidability and axiomatisability for bisimulation equivalence on basic parallel processes, in: Proc. 8th Ann. Symp. on Logic in Computer Science, IEEE Computer Science Press, Silver Spring, MD, 1993.
13. S. Christensen, Y. Hirshfeld, F. Moller, Bisimulation is decidable for basic parallel processes, Lecture Notes in Computer Science, vol. 715, Springer, Berlin, 1993, pp. 143-157.
14. S. Christensen, H. Hüttel, C. Stirling, Bisimulation equivalence is decidable for all context-free processes, Inform. Comput. 121 (1995) 143-148.
15. J. Groote, A short proof of the decidability of bisimulation for normed BPA processes, Inform. Processing Lett. 42 (1992) 167-171.
16. J. Groote, H. Hüttel, Undecidable equivalences for basic process algebra, Inform. Comput. 115 (1994) 354-371.
17. Y. Hirshfeld, Deciding equivalences in simple process algebras, Tech. Report ECS-LFCS-94-294, Edinburgh University, 1994.
18. Y. Hirshfeld, Bisimulation trees and the decidability of weak bisimulations, to appear.
19. Y. Hirshfeld, M. Jerrum, F. Moller, A polynomial algorithm for deciding bisimilarity of normed context-free processes, Proc. IEEE 35th Ann. Symp. on Foundations of Computer Science, 1994, pp. 623-631.
20. J. Hopcroft, J. Ullman, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, Reading, MA, 1979.
21. H. Hüttel, Undecidable equivalences for basic parallel processes, Lecture Notes in Computer Science, vol. 789, Springer, Berlin, 1994.
22. H. Hüttel, C. Stirling, Actions speak louder than words: proving bisimilarity for context free processes, Proc. 6th Ann. Symp. on Logic in Computer Science, IEEE Computer Science Press, Silver Spring, MD, 1991, pp. 376-386.
23. P. Jančar, Decidability questions for bisimilarity of Petri nets and some related problems, Lecture Notes in Computer Science, vol. 775, Springer, Berlin, 1994, pp. 581-594.
24. F. Moller, Infinite results, Lecture Notes in Computer Science, vol. 1119, Springer, Berlin, 1996, pp. 195-216.
25. D. Muller, P. Schupp, The theory of ends, pushdown automata, and second-order logic, Theoret. Comput. Sci. 37 (1985) 51-75.
26. M. Oyamuguchi, N. Honda, Y. Inagaki, The equivalence problem for real-time strict deterministic languages, Inform. Control 45 (1980) 90-115.
27. G. Sénizergues, The equivalence problem for deterministic pushdown automata is decidable, ICALP'97, to appear.