MODEL CHECKING AND STATE MACHINES

Probabilistic systems coalgebraically: A survey

Resource type
Author/contributor
Title
Probabilistic systems coalgebraically: A survey
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.
Publication
Theoretical Computer Science
Volume
412
Issue
38
Pages
5095-5110
Date
2011-9-02
Journal Abbr
Theor Comput Sci
DOI
10/frbx24
ISSN
0304-3975
Short Title
Probabilistic systems coalgebraically
Accessed
2019-11-26T19:05:39Z
Library Catalog
PubMed Central
Extra
ZSCC: 0000057 PMID: 21998490 PMCID: PMC3185909
Citation
Sokolova, A. (2011). Probabilistic systems coalgebraically: A survey. Theoretical Computer Science, 412(38), 5095–5110. https://doi.org/10/frbx24
Processing time: 0.03 seconds

Graph of references

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