Publication year
Online resource

Bisimulation for probabilistic transition systems: A coalgebraic approach

Resource type
Authors/contributors
Title
Bisimulation for probabilistic transition systems: A coalgebraic approach
Abstract
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 Mendier 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.
Date
1997
Proceedings Title
Automata, Languages and Programming
Place
Berlin, Heidelberg
Publisher
Springer
Pages
460-470
Series
Lecture Notes in Computer Science
Language
en
DOI
10/fcqzmk
ISBN
978-3-540-69194-5
Short Title
Bisimulation for probabilistic transition systems
Library Catalog
Springer Link
Extra
ZSCC: NoCitationData[s1]
Citation
de Vink, E. P., & Rutten, J. J. M. M. (1997). Bisimulation for probabilistic transition systems: A coalgebraic approach. In P. Degano, R. Gorrieri, & A. Marchetti-Spaccamela (Eds.), Automata, Languages and Programming (pp. 460–470). Berlin, Heidelberg: Springer. https://doi.org/10/fcqzmk
PROBABILITY & STATISTICS
Processing time: 0.04 seconds

Graph of references

(from Zotero to Gephi via Zotnet with this script)
Graph of references