Probabilistic Domains

We show the equivalence of several diierent axiomatizations of the notion of (abstract) probabilistic domain in the category of dcpo's and continuous functions. The axiomatization with the richest set of operations provides probabilistic selection among a nite number of possibilities with arbitrary probabilities, whereas the poorest one has binary choice with equal probabilities as the only operation. The remaining theories lie in between; one of them is the theory of binary choice by Graham 1].

[1]  Reinhold Heckmann.  Product Operations in Strong Monads , 1993, Theory and Formal Methods.

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

[3]  Eugenio Moggi,et al.  Computational lambda-calculus and monads , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.

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

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

[6]  Steven K. Graham,et al.  Closure Properties of a Probabilistic Domain Construction , 1987, MFPS.