Abstract
In the past decade there has been a variety of results showing decidability of bisimulation equivalence between infinite state systems. The initial result, due to Baeten, Bergstra and Klop [1], proved decidability for normed BPA processes, described using irredundant context-free grammars. This was extended to all BPA processes and then to pushdown automata [5,16,14]. Decidability of bisimilarity was also shown for Basic Parallel (BP) processes, a restricted subset of Petri nets, [4]. For full Petri nets Jančar proved that bisimulation equivalence is undecidable [11].
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Baeten, J., Bergstra, J. and Klop, J. (1993). Decidability of bisimulation equivalence for processes generating context-free languages. Journal of Association for computing Machinery, 40, 653–682.
Caucal, D. (1996). On infinite transition graphs having a decidable monadic theory. Lecture Notes in Computer Science, 1099, 194–205.
Christensen, S. (1993). Decidability and Decomposition in Process Algebras. Ph.D thesis University of Edinburgh, Tech Report ECS-LFCS-93-278.
Christensen, S., Hirshfeld, Y. and Moller, F. (1993). Bisimulation equivalence is decidable for all basic parallel processes. Lecture Notes in Computer Science, 715, 143–157.
Christensen, S., Huttel, H., and Stirling, C. (1995). Bisimulation equivalence is decidable for all context-free processes. Information and Computation, 121, 143–148.
Esparza, J. (1997). Petri nets, commutative context-free grammars, and basic parallel processes. Fundamenta Informaticae, 30, 23–41.
Hirshfeld, Y. (1996). Bisimulation trees and the decidability of weak bisimilarity. Electronic Notes in Theoretical Computer Science, 5.
Hirshfeld, Y., Jerrum, M. and Moller, F. (1996). A polynomial-time algorithm for deciding equivalence of normed basic parallel processes. Journal of Mathematical Structures in Computer Science, 6, 251–259.
Huttel, H. (1991). Silence is golden: branching bisimilarity is decidable for context-free processes. Lecture Notes in Computer Science, 575, 2–12.
Huttel, 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. (1995). Undecidability of bisimilarity for Petri nets and some related problems. Theoretical Computer Science, 148, 281–301.
Jančar, P., Kučera, A. and Mayr, R. (1998). Deciding bisimulation-like equivalences with finite-state processes. Lecture Notes in Computer Science, 1443, 200–211.
Milner, R. (1989) Communication and Concurrency. Prentice-Hall.
Sénizergues, G. (1998). Decidability of bisimulation equivalence for equational graphs of finite out-degree. Procs. IEEE FOCS’98, 120–129.
Stříbrná, J. (1999). Decidability and complexity of equivalences for simple process algebras. Ph.D thesis, University of Edinburgh, Tech. Report ECS-LFCS-99-408.
Stirling, C. (1998). Decidability of bisimulation equivalence for normed pushdown processes. Theoretical Computer Science, 195, 113–131.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Stirling, C. (2001). Decidability of Weak Bisimilarity for a Subset of Basic Parallel Processes. In: Honsell, F., Miculan, M. (eds) Foundations of Software Science and Computation Structures. FoSSaCS 2001. Lecture Notes in Computer Science, vol 2030. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45315-6_25
Download citation
DOI: https://doi.org/10.1007/3-540-45315-6_25
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41864-1
Online ISBN: 978-3-540-45315-4
eBook Packages: Springer Book Archive