Probabilistic Relations

The notion of binary relation is fundamental in logic. What is the correct analogue of this concept in the probabilistic case? I will argue that the notion of conditional probability distribution (Markov kernel, stochastic kernel) is the correct generalization. One can deene a category based on stochastic kernels which has many of the formal properties of the ordinary category of relations. Using this concept I will show how to deene iteration in this category and give a simple treatment of Kozen's language of while loops and probabilistic choice. I will use the concept of stochastic relation to introduce some of the ongoing joint work with Edalat and Desharnais on Labeled Markov Processes. In my talk I will assume that people do not know what partially additive categories are but that they do know basic category theory and basic notions like measure and probability. This work is mainly due to Kozen, Giry, Lawvere and others.

[1]  F. W. Lawvere,et al.  FUNCTORIAL SEMANTICS OF ALGEBRAIC THEORIES. , 1963, Proceedings of the National Academy of Sciences of the United States of America.

[2]  Dexter Kozen,et al.  Semantics of probabilistic programs , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[3]  Michael A. Arbib,et al.  Algebraic Approaches to Program Semantics , 1986, Texts and Monographs in Computer Science.

[4]  Samson Abramsky,et al.  Retracing some paths in Process Algebra , 1996, CONCUR.

[5]  Abbas Edalat,et al.  Bisimulation for labelled Markov processes , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.

[6]  Abbas Edalat,et al.  A logical characterization of bisimulation for labeled Markov processes , 1998, Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226).

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