Kleisli morphisms and randomized congruences for the Giry monad

Journal of Pure and Applied Algebra

Volumn 211, Issue 3, 2007, Pages 638-664

  Doberkat, Ernst Erich ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 34447650958     PISSN: 00224049     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jpaa.2007.03.003     Document Type: Article

References (29)

1. *-categories. J. Pure Appl. Algebra 143 1-3 (1999) 3-47
2. *-Algebra. Graduate Texts in Mathematics (1976), Springer-Verlag, New York
3. Baier C., Haverkort B., Hermanns H., and Katoen J.-P. Model-checking algorithms for continuous time Markov chains. IEEE Trans. Softw. Eng. 29 6 (2003) 524-541
4. Desharnais J., Edalat A., and Panangaden P. Bisimulation of labelled Markov-processes. Inform. and Comput. 179 2 (2002) 163-193
5. Desharnais J., and Panangaden P. Continuous stochastic logic characterizes bisimulation of continuous-time Markov processes. J. Log. Algebr. Program. 56 1-2 (2003) 99-115
6. Doberkat E.-E. Eilenberg-Moore algebras for stochastic relations. Inform. and Comput. 204 (2006) 1756-1781
7. Doberkat E.-E. Stochastic relations: Congruences, bisimulations and the Hennessy-Milner theorem. SIAM J. Comput. 35 3 (2006) 626
8. Doberkat E.-E. Stochastic Relations. Foundations for Markov Transition Systems (2007), Chapman & Hall/CRC Press, Boca Raton, New York
9. Giry M. A categorical approach to probability theory. Categorical Aspects of Topology and Analysis. Lect. Notes Math. vol. 915 (1981), Springer-Verlag, Berlin 68-85
10. Grätzer G. Universal Algebra. The University Series in Higher Mathematics (1968), Van Nostrand, Princeton, N.J.
11. Hennessy M., and Milner R. On observing nondeterminism and concurrency. Proc. ICALP'80. Lect. Notes Comp. Sci. vol. 85 (1980), Springer-Verlag, Berlin 395-409
12. Hinderer K. Foundations of non-stationary dynamic programming with discrete time parameter. Lect. Notes Op. Re. Math. Syst. vol. 33 (1970), Springer-Verlag, Berlin
13. C. Jones, Probabilistic non-determinism, Ph.D. Thesis, Univ. Edinburgh, 1989
14. Jones C., and Plotkin G. A probabilistic powerdomain of evaluations. Proc. LICS'89 (1989), IEEE Computer Society Press 186-195
15. Kechris A.S. Classical Descriptive Set Theory. Graduate Texts in Mathematics (1994), Springer-Verlag, Berlin, Heidelberg, New York
16. G. Lajios, Zur kategoriellen Beschreibung von Schichtenarchitekturen, Ph.D. Thesis, Chair for Software Technology, University of Dortmund, March 2006
17. Lang S. Algebra (1965), Addison-Wesley, Reading, Mass.
18. Larsen K.G., and Skou A. Bisimulation through probabilistic testing. Inform. and Comput. 94 (1991) 1-28
19. MacLane S. Categories for the Working Mathematician. Graduate Texts in Mathematics (1997), Springer-Verlag, Berlin
20. Moggi E. Notions of computation and monads. Inform. and Comput. 93 (1991) 55-92
21. Osius G. Categorical set theory: A characterisation of the category of sets. J. Pure Appl. Algebra 4 (1974) 79-119
22. P. Panangaden, Stochastic techniques in concurrency, Technical Report, BRICS, Dept. of Comp. Sci., Univ. of Aarhus, 1997
23. Panangaden P. Probabilistic relations. In: Baier C., Huth M., Kwiatkowska M., and Ryan M. (Eds). Proc. PROBMIV (1998) 59-74
24. Parthasarathy K.R. Probability Measures on Metric Spaces (1967), Academic Press, New York
25. Pumplün D. Positively convex modules and ordered normed linear spaces. J. Convex Anal. 10 1 (2003) 109-127
26. Rutten J.J.M.M. Universal coalgebra: A theory of systems (Modern algebra and its applications). Theoret. Comput. Sci. 249 1 (2000) 3-80 (special issue)
27. Srivastava S.M. A Course on Borel Sets. Graduate Texts in Mathematics (1998), Springer-Verlag, Berlin
28. Taylor P. Practical Foundations of Mathematics. Cambridge Studies in Advanced Mathematics vol. 59 (1999), Cambridge University Press, Cambridge
29. van Breugel F., Mislove M., Ouaknine J., and Worrell J. Domain theory, testing and simulation for labelled Markov processes. Theoret. Comput. Sci. 333 (2005) 171-197