The notion of bisimulation as proposed by Larsen and Skou for discrete probabilistic transition systems is shown to coincide with a coalgebraic definition in the sense of Aczel and Mendler in terms of a set functor. This coalgebraic formulation makes it possible to generalize the concepts to a continuous setting involving Borel probability measures. Under reasonable conditions, generalized probabilistic bisimilarity can be characterized categorically. Application of the final coalgebra paradigm then yields an internally fully abstract semantical domain with respect to probabilistic bisimulation.
CITATION STYLE
De Vink, E. P., & Rutten, J. J. M. M. (1997). Bisimulation for probabilistic transition systems: A coalgebraic approach. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1256, pp. 460–470). Springer Verlag. https://doi.org/10.1007/3-540-63165-8_202
Mendeley helps you to discover research relevant for your work.