Kleisli morphisms and randomized congruences for the Giry monad

Abstract Stochastic relations are the Kleisli morphisms for the Giry monad. This paper proposes the study of the associated morphisms and congruences. The relationship between kernels of these morphisms and congruences is studied, and a unique factorization of a morphism through this kernel is shown to exist. This study is based on an investigation into countably generated equivalence relations on the space of all subprobabilities. Operations on these relations are investigated quite closely. This utilizes positive convex structures and indicates cross-connections to Eilenberg–Moore algebras for the Giry monad. Hennessy–Milner logic serves as an illustration for randomized morphisms and congruences.

[1]  E. Doberkat.  Stochastic Relations : Foundations for Markov Transition Systems , 2007 .

[2]  Claire Jones,et al.  Probabilistic non-determinism , 1990 .

[3]  Christel Baier,et al.  Model-Checking Algorithms for Continuous-Time Markov Chains , 2002, IEEE Trans. Software Eng..

[4]  Jan J. M. M. Rutten,et al.  Universal coalgebra: a theory of systems , 2000, Theor. Comput. Sci..

[5]  Ernst-Erich Doberkat.  Stochastic Relations: Congruences, Bisimulations and the Hennessy--Milner Theorem , 2005, SIAM J. Comput..

[6]  Prakash Panangaden,et al.  Continuous stochastic logic characterizes bisimulation of continuous-time Markov processes , 2003, J. Log. Algebraic Methods Program..

[7]  Joël Ouaknine,et al.  Domain theory, testing and simulation for labelled Markov processes , 2005, Theor. Comput. Sci..

[8]  Eugenio Moggi,et al.  Notions of Computation and Monads , 1991, Inf. Comput..

[9]  Georgios Lajios,et al.  Zur kategoriellen Beschreibung von Schichtenarchitekturen , 2005 .

[10]  P. Panangaden,et al.  Nuclear and trace ideals in tensored-categories , 1998, math/9805102.

[11]  K. Hinderer,et al.  Foundations of Non-stationary Dynamic Programming with Discrete Time Parameter , 1970 .

[12]  Michèle Giry,et al.  A categorical approach to probability theory , 1982 .

[13]  C. Jones,et al.  A probabilistic powerdomain of evaluations , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.

[14]  Gerhard Osius,et al.  Categorical set theory: A characterization of the category of sets , 1974 .

[15]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[16]  Kim G. Larsen,et al.  Bisimulation through Probabilistic Testing , 1991, Inf. Comput..

[17]  K. Parthasarathy,et al.  Probability measures on metric spaces , 1967 .

[18]  Ernst-Erich Doberkat,et al.  Eilenberg-Moore algebras for stochastic relations , 2006, Inf. Comput..

[19]  Abbas Edalat,et al.  Bisimulation for Labelled Markov Processes , 2002, Inf. Comput..