The converse of a stochastic relation

Authors:
Ernst-Erich Doberkat
Affiliations:
Software Technology, University of Dortmund
Venue:
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
Year:
2003

Citing 5
Cited 0

Relational methods in computer science

Relational methods in computer science
Universal coalgebra: a theory of systems

Theoretical Computer Science - Modern algebra and its applications
The Demonic Product of Probabilistic Relations

FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
A Final Coalgebra Theorem

Category Theory and Computer Science
Semi-pullbacks and bisimulation in categories of Markov processes

Mathematical Structures in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Transition probabilities are proposed as the stochastic counterparts to set-based relations. We propose the construction of the converse of a stochastic relation. It is shown that two of the most useful properties carry over: the converse is idempotent as well as anticommutative. The nondeterminism associated with a stochastic relation is defined and briefly investigated. We define a bisimulation relation, and indicate conditions under which this relation is transitive; moreover it is shown that bisimulation and converse are compatible.