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
Model-Checking Algorithms for Continuous-Time Markov Chains
IEEE Transactions on Software Engineering
Behavioural differential equations: a coinductive calculus of streams, automata, and power series
Theoretical Computer Science
Factoring stochastic relations
Information Processing Letters
Semi-pullbacks for stochastic relations over analytic spaces
Mathematical Structures in Computer Science
Semi-pullbacks and bisimulations in categories of stochastic relations
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Bisimilarity of Distributionally Equivalent Markov Transition Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
Simple systems cannot decomposed further. Algebraically, simple systems have only isomorphisms as epis. We characterize simple stochastic relations through different forms of bisimulations for the case that the underlying spaces are Polish, and analytic, respectively. This requires a closer investigation of bisimulations, congruences and their mutual relationship. We provide a complete characterization of simple stochastic relations for analytic spaces.