Abstract
The maximal strong and weak bisimulations on any class of processes can be obtained as the limits of decreasing chains of binary relations, approximants. In the case of strong bisimulation and Basic Process Algebras this chain has length at most ω which enables semidecidability of strong bisimilarity. We show that it is not so for weak bisimulation where the chain can grow much longer, and discuss the implications this has for (semi)decidability of weak bisimilarity.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Baeten J.C.M., Bergstra J.A. and Klop J.W.: Decidability of bisimulation equivalence for processes generating context-free languages. In Proceedings of PARLE’87, LNCS 259, 1987.
Burkart O., Caucal D and Steffen B.: An elementary bisimulation decision procedure for arbitrary context-free processes. In Aachener Informatik-Berichte 94–28, 1994.
Christensen S., Hüttel H. and Stirling C: Bisimulation equivalence is decidable for all context-free processes. In Proceedings of CONCUR 92, LNCS 630, 138–147, 1992.
Hirshfeld Y.: Bisimulation Trees and the Decidability of Weak Bisimulation. In Proceedings of INFINITY’96, Steffen B., Caucal D. (Eds.), ENTCS 5, 1996.
Levy A.: Basic Set Theory. Springer-Verlag, Berlin, 1979.
Milner R.: Communication and Concurrency. Prentice-Hall, 1989.
Hinman P.G.: Recursion-Theoretic Hierarchies. Springer-Verlag, Berlin Heidelberg New York, 1978.
Sénizergues G.: Decidability of bisimulation equivalence for equational graphs of finite out-degree. In Proceedings of FOCS’98, IEEE, 120–129, 1998.
Stříbrná J.: Decidability and Complexity of Equivalences for Simple Process Algebras. Ph.D. thesis, University of Edinburgh, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Stříbrná, J. (1999). Approximating Weak Bisimulation on Basic Process Algebras. In: Kutyłowski, M., Pacholski, L., Wierzbicki, T. (eds) Mathematical Foundations of Computer Science 1999. MFCS 1999. Lecture Notes in Computer Science, vol 1672. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48340-3_33
Download citation
DOI: https://doi.org/10.1007/3-540-48340-3_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66408-6
Online ISBN: 978-3-540-48340-3
eBook Packages: Springer Book Archive