Semi-pullbacks and Bisimulations in Categories of Stochastic Relations
The problem of constructing a semi-pullback in a category is intimately connected to the problem of establishing the transitivity of bisimulations. Edalat shows that a semi-pullback can be constructed in the category of Markov processes on Polish spaces, when the underlying transition probability functions are universally measurable, and the morphisms are measure preserving continuous maps. We demonstrate that the simpler assumption of Borel measurability suffices. Markov processes are in fact a special case: we consider the category of stochastic relations over Standard Borel spaces. At the core of the present solution lies a selection argument from stochastic dynamic optimization. An example demonstrates that (weak) pullbacks do not exist in the category of Markov processes.
KeywordsBisimulation semi-pullback stochastic relations labelled Markov processes Hennessy-Milner logic
Unable to display preview. Download preview PDF.
- J. Desharnais, V. Gupta, R. Jagadeesan, and P. Panangaden. Approximating labeled Markov processes. In Proc. 15th Symposium on Logic in Computer Science, pages 95–106. IEEE, 2000.Google Scholar
- E.-E. Doberkat. The demonic product of probabilistic relations. In Mogens Nielsen and Uffe Engberg, editors, Proc. Foundations of Software Science and Computation Structures, volume 2303 of Lecture Notes in Computer Science, pages 113–127, Berlin, 2002. Springer-Verlag.Google Scholar
- E.-E. Doberkat. A remark on A. Edalat’s paper Semi-Pullbacks and Bisimulations in Categories of Markov-Processes. Technical Report 125, Chair for Software Technology, University of Dortmund, July 2002.Google Scholar