Abstract
Bisimulation-up-to enhances the bisimulation proof method for process equivalence. We present its generalization from labelled transition systems to arbitrary coalgebras, and show that for a large class of systems, enhancements such as bisimulation up to bisimilarity, up to equivalence and up to context are sound proof techniques. This allows for simplified bisimulation proofs for many different types of state-based systems. © 2013 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Rot, J., Bonsangue, M., & Rutten, J. (2013). Coalgebraic bisimulation-up-to. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7741 LNCS, pp. 369–381). https://doi.org/10.1007/978-3-642-35843-2_32
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
