Abstract
The aim of this paper is to introduce a coalgebraic setting in which it is possible to generalize and compare the two known approaches to defining weak bisimulation for labelled transition systems. We introduce two definitions of weak bisimulation for coalgebras over ordered functors, show their properties and give sufficient conditions for them to coincide. We formulate a weak coinduction principle.
Chapter PDF
Similar content being viewed by others
References
Baier, C., Hermanns, H.: Weak Bisimulation for Fully Probabilistic Processes. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol. 1254, pp. 119–130. Springer, Heidelberg (1997)
Gumm, H.P.: Elements of the general theory of coalgebras. In: LUATCS 1999, Rand Afrikaans University, Johannesburg (1999)
Hughes, J., Jacobs, B.: Simulations in coalgebra. TCS 327(1-2), 71–108 (2004)
Milner, R.: A Calculus of Communication Systems. LNCS, vol. 92. Springer, Heidelberg (1980)
Rothe, J.: A syntactical approach to weak (bi)-simulation for coalgebras. In: Moss, L. (ed.) Proc. CMCS 2002. ENTCS, vol. 65, pp. 270–285 (2002)
Rothe, J., Masulović, D.: Towards weak bisimulation for coalgebras. In: Proc. Categorical Methods for Concurrency, Interaction and Mobility. ENTCS, vol. 68(1), pp. 32–46 (2002)
Segala, R., Lynch, N.: Probabilistic Simulations for Probabilistic Processes. In: Jonsson, B., Parrow, J. (eds.) CONCUR 1994. LNCS, vol. 836, pp. 481–496. Springer, Heidelberg (1994)
Segala, R.: Modeling and verification of randomized distributed real-time systems. Ph.D. thesis. MIT (1995)
Sokolova, A., de Vink, E., Woracek, H.: Coalgebraic Weak Bisimulation for Action-Type Systems. Sci. Ann. Comp. Sci. 19, 93–144 (2009)
Rutten, J.J.M.M.: A note on coinduction and weak bisimilarity for while programs. Theoretical Informatics and Applications (RAIRO) 33, 393–400 (1999)
Rutten, J.J.M.M.: Universal coalgebra: a theory of systems. TCS 249(1), 3–80 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 IFIP International Federation for Information Processing
About this paper
Cite this paper
Brengos, T. (2012). Weak Bisimulations for Coalgebras over Ordered Functors. In: Baeten, J.C.M., Ball, T., de Boer, F.S. (eds) Theoretical Computer Science. TCS 2012. Lecture Notes in Computer Science, vol 7604. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33475-7_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-33475-7_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33474-0
Online ISBN: 978-3-642-33475-7
eBook Packages: Computer ScienceComputer Science (R0)