Elsevier

Theoretical Computer Science

Volume 412, Issue 38, 2 September 2011, Pages 5095-5110
Theoretical Computer Science

Probabilistic systems coalgebraically: A survey

https://doi.org/10.1016/j.tcs.2011.05.008Get rights and content
Under a Creative Commons license
open access

Abstract

We survey the work on both discrete and continuous-space probabilistic systems as coalgebras, starting with how probabilistic systems are modeled as coalgebras and followed by a discussion of their bisimilarity and behavioral equivalence, mentioning results that follow from the coalgebraic treatment of probabilistic systems. It is interesting to note that, for different reasons, for both discrete and continuous probabilistic systems it may be more convenient to work with behavioral equivalence than with bisimilarity.

Keywords

Probabilistic systems
Coalgebra
Markov chains
Markov processes

Cited by (0)