Decidability of bisimulation equivalence for normed pushdown processes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1119, Issue , 1996, Pages 217-232

  Stirling, Colin ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84955596293     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61604-7_57     Document Type: Conference Paper

References (20)

1. Bacten, J., Bergstra, J., and Klop, J. (1987). Decidability of bisimulation equiwMence for processes generating context-free languages. Lecture Notes in Computer Science, 259, 94-113
2. Baeten, J., Bergstra, J., and Klop, J. (1993). Decidability of bisimulation equivalence for processes generating context-free languages. Journal of Association of Computing Machinery, 40, 653-682
3. Burkart, O., and Steffen, B.(1995). Composition, decomposition, and model checking of pnshdown processes. Nordic Journal of Computing, 2, 89-125
4. Burkart, O., Caucal, D., and Steffen, B. (1994). An elementary decision procedure for arbitrary context-free processes. Tech. Report 94-28, RWTH Aachen
5. Caucal, D. (1990). Graphes canoniques de graphes algdbriques, lnformatique Thgorique et Applications (RAIRO), 24, 339-352
6. Caucal, D. (1992). On the regular structure of prefix rewriting. Theoretical Computer Science, 106, 61-86
7. Caucal, D., and Monfort, R. (1990). On the transition graphs of automata and grammars. Lecture Notes in Computer Science, 484, 311-337
8. Christensen, S., Hirslffeld, Y., and Moiler, F. (1993). Decomposability, decidability and axiomatisability for bisimulation equivalence on basic parallel processes. Proceedings 8th Annual Symposium on Logic in Computer Science, IEEE Computer Science Press
9. Christensen, S., Hirshfeld, Y., and Moller, F. (1993). Bisimulation is decidable for basic parallel processes. Lecture Notes in Computer Science, 715, 143-157
10. Christensen, S., Hiittel, H., and Stirling, C. (1995). Bisimulation equivalence is decidable for all context-free processes. Information and Computation, 121, 143-148
11. Groote, J. (1992). A short proof of the decidability of bisimulation for normed BPA processes. Information Processing Letters, 42, 167-171
12. Groote, J., and Hiittel, H. (1994). Undecidable equivalences for basic process algebra. Information and Computation
13. Hirshfeld, Y. (1994). Deciding equivalences in simple process algebras. Tech. Report ECS-LPCS-94-294, Edinburgh University
14. Hirshfeld, Y., Jerrum, M., and Moiler, P. (1994). A polynomial algorithm for deciding bisimilarity of normed context-free processes. Procs. IEEE 35th Annual Symposium on Foundations of Computer Science, 623-631
15. Hopcroft, J., and Ullman, J. (1979). Introduction to Automata Theory, Languages, and Computation, Addison-Wesley
16. Hüttel, H. (1993). Undecidable equivalences for basic parallel processes. Tech. Report ECS-LFCS-93-276, Edinburgh University
17. Hüttel, H., and Stirring, C. (1991). Actions speak louder than words: proving bisimilarity for context free processes. Proceedings 6th Annual Symposium on Logic in Computer Science, IEEE Computer Science Press, 386-386
18. Jančar, P. (1994). Decidability questions for bisimilarity of Petri nets and some related problems. Lecture Notes in Computer Science, 775, 581-594
19. Muller, D., and Schupp, P. (1985). The theory of ends, pushdown automata, and second-order logic. Theoretical Computer Science, 37, 51-75
20. Oyamuguchi, M., Honda, N., and Inagaki, Y. (1980). The equivalence problem for real-time strict deterministic languages. Information and Control, 45, 90-115.