Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Baier, C., Haverkort, B., Hermanns, H., Koert, J.-P.: Model-checking algorithms for continuous time Markov chains. IEEE Trans. Softw. Eng. 29(6), 524–541 (2003)
Desharnais, J., Edalat, A., Panangaden, P.: Bisimulation of labelled Markov-processes. Information and Computation 179(2), 163–193 (2002)
Doberkat, E.-E.: Semi-pullbacks and bisimulations in categories of stochastic relations. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 996–1007. Springer, Heidelberg (2003)
Doberkat, E.-E.: Factoring stochastic relations. Information Processing Letters 90(4), 161–166 (2004)
Doberkat, E.-E.: Look: simple stochastic relations are just, well, simple. Technical Report 152, Chair for Software Technology, University of Dortmund (November 2004)
Doberkat, E.-E.: Semi-pullbacks for stochastic relations over analytic spaces. Math. Struct. Comp. Sci (2005) (in print)
Doberkat, E.-E.: Zeno paths, congruences and bisimulations for continuous-time stochastic logic. Technical Report 155, Chair for Software Technology, University of Dortmund (March 2005)
Lang, S.: Algebra. Addison-Wesley, Reading (1965)
Rutten, J.J.M.M.: Universal coalgebra: a theory of systems. Theoretical Computer Science 249(1), 3–80 (2000); Special issue on modern algebra and its applications
Rutten, J.J.M.M.: Bisimulation in enumerative combinatorics. ENTCS 65(1), 1–19 (2002)
Rutten, J.J.M.M.: Behavioral differential equations: a coinductive calculus of streams, automata and power series. Theor. Comp. Sci. 308, 1–53 (2003)
Srivastava, S.M.: A Course on Borel Sets. Graduate Texts in Mathematics. Springer, Berlin (1998)
Wagner, D.H.: A survey of measurable selection theorems. SIAM J. Control Optim. 15(5), 859–903 (1977)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Doberkat, EE. (2005). Look: Simple Stochastic Relations Are Just, Well, Simple. In: Fiadeiro, J.L., Harman, N., Roggenbach, M., Rutten, J. (eds) Algebra and Coalgebra in Computer Science. CALCO 2005. Lecture Notes in Computer Science, vol 3629. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11548133_9
Download citation
DOI: https://doi.org/10.1007/11548133_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28620-2
Online ISBN: 978-3-540-31876-7
eBook Packages: Computer ScienceComputer Science (R0)