Factoring stochastic relations

Authors:
Ernst-Erich Doberkat
Affiliations:
Chair for Software Technology, University of Dortmund, 44221 Dortmund, Germany
Venue:
Information Processing Letters
Year:
2004

Citing 3
Cited 2

Universal coalgebra: a theory of systems

Theoretical Computer Science - Modern algebra and its applications
Bisimulation for labelled Markov processes

Information and Computation - Special issue: LICS'97
Semi-pullbacks and bisimulations in categories of stochastic relations

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming

Semi-pullbacks for stochastic relations over analytic spaces

Mathematical Structures in Computer Science
Look: simple stochastic relations are just, well, simple

CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science

Quantified Score

Hi-index	0.89

Visualization

Abstract

When a system represented through a stochastic model is observed, the equivalence of behavior is described through the observation that equivalent inputs lead to equivalent outputs. This paper has a look at the systems that arise when the stochastic model is factored through the congruence. Congruences may refine each other, and we show that this refinement is reflected through factoring.