MODEL CHECKING AND STATE MACHINES

A hierarchy of probabilistic system types

Resource type
Authors/contributors
Title
A hierarchy of probabilistic system types
Abstract
We arrange various types of probabilistic transition systems studied in the literature in an expressiveness hierarchy. The expressiveness criterion is the existence of an embedding of systems of the one class into those of the other. An embedding here is a system transformation which preserves and reflects bisimilarity. To facilitate the task, we define the classes of systems and the corresponding notion of bisimilarity coalgebraically and use the new technical result that an embedding arises from a natural transformation with injective components between the two coalgebra functors under consideration. Moreover, we argue that coalgebraic bisimilarity, on which we base our results, coincides with the concrete notions proposed in the literature for the different system classes, exemplified by a detailed proof for the case of general Segala-type systems.
Publication
Electronic Notes in Theoretical Computer Science
Volume
82
Issue
1
Pages
57-75
Date
July 1, 2003
Series
CMCS'03, Coalgebraic Methods in Computer Science (Satellite Event for ETAPS 2003)
Journal Abbr
Electronic Notes in Theoretical Computer Science
Language
en
DOI
10/d7kq38
ISSN
1571-0661
Accessed
2019-11-26T18:15:53Z
Library Catalog
ScienceDirect
Extra
ZSCC: 0000049
Citation
Bartels, F., Sokolova, A., & de Vink, E. (2003). A hierarchy of probabilistic system types. Electronic Notes in Theoretical Computer Science, 82(1), 57–75. https://doi.org/10/d7kq38
Processing time: 0.03 seconds

Graph of references

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