This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Baeten, J., Bergstra, J., and Klop, J. (1987). Decidability of bisimulation equivalence for processes generating context-free languages. Lecture Notes in Computer Science, 259, 94–113.
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.
Burkart, O., and Steffen, B. (1995). Composition, decomposition, and model checking of pushdown processes. Nordic Journal of Computing, 2, 89–125.
Burkart, O., Caucal, D., and Steffen, B. (1994). An elementary decision procedure for arbitrary context-free processes. Tech. Report 94-28, RWTH Aachen.
Caucal, D. (1990). Graphes canoniques de graphes algébriques. Informatique Théorique et Applications (RAIRO), 24, 339–352.
Caucal, D. (1992). On the regular structure of prefix rewriting. Theoretical Computer Science, 106, 61–86.
Caucal, D., and Monfort, R. (1990). On the transition graphs of automata and grammars. Lecture Notes in Computer Science, 484, 311–337.
Christensen, S., Hirshfeld, Y., and Moller, 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.
Christensen, S., Hirshfeld, Y., and Moller, F. (1993). Bisimulation is decidable for basic parallel processes. Lecture Notes in Computer Science, 715, 143–157.
Christensen, S., Hüttel, H., and Stirling, C. (1995). Bisimulation equivalence is decidable for all context-free processes. Information and Computation, 121, 143–148.
Groote, J. (1992). A short proof of the decidability of bisimulation for normed BPA processes. Information Processing Letters, 42, 167–171.
Groote, J., and Hüttel, H. (1994). Undecidable equivalences for basic process algebra. Information and Computation.
Hirshfeld, Y. (1994). Deciding equivalences in simple process algebras. Tech. Report ECS-LFCS-94-294, Edinburgh University.
Hirshfeld, Y., Jerrum, M., and Moller, F. (1994). A polynomial algorithm for deciding bisimilarity of normed context-free processes. Procs. IEEE 35th Annual Symposium on Foundations of Computer Science, 623–631.
Hopcroft, J., and Ullman, J. (1979). Introduction to Automata Theory, Languages, and Computation, Addison-Wesley.
Hüttel, H. (1993). Undecidable equivalences for basic parallel processes. Tech. Report ECS-LFCS-93-276, Edinburgh University.
Hüttel, H., and Stirling, 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, 376–386.
Jančar, P. (1994). Decidability questions for bisimilarity of Petri nets and some related problems. Lecture Notes in Computer Science, 775, 581–594.
Muller, D., and Schupp, P. (1985). The theory of ends, pushdown automata, and second-order logic. Theoretical Computer Science, 37, 51–75.
Oyamuguchi, M., Honda, N., and Inagaki, Y. (1980). The equivalence problem for real-time strict deterministic languages. Information and Control, 45, 90–115.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Stirling, C. (1996). Decidability of bisimulation equivalence for normed pushdown processes. In: Montanari, U., Sassone, V. (eds) CONCUR '96: Concurrency Theory. CONCUR 1996. Lecture Notes in Computer Science, vol 1119. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61604-7_57
Download citation
DOI: https://doi.org/10.1007/3-540-61604-7_57
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61604-7
Online ISBN: 978-3-540-70625-0
eBook Packages: Springer Book Archive