Bisimulation for labelled Markov processes
Information and Computation - Special issue: LICS'97
Semi-pullbacks and bisimulation in categories of Markov processes
Mathematical Structures in Computer Science
Factoring stochastic relations
Information Processing Letters
Semi-pullbacks and bisimulations in categories of stochastic relations
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Coalgebraic logic over general measurable spaces ??? a survey
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
Hyperfinite approximations to labeled markov transition systems
AMAST'06 Proceedings of the 11th international conference on Algebraic Methodology and Software Technology
Approximating Markov processes through filtration
Theoretical Computer Science
| Hi-index | 0.00 |
The existence of semi-pullbacks for stochastic relations over analytic spaces is addressed. It is shown by means of a measure extension that the theory of measurable selectors for measurable relations may be employed for its solution. The category of stochastic relations is shown not to have (weak) pullbacks.