The Converse of a Probabilistic Relation

Transition probabilities are proposed as the stochastic counterparts to set-based relations. We propose the construction of the converse of a probabilistic relation. It is shown that two of the most useful properties carry over: the converse is idempotent, and anticommutative. The last property is shown to hold relative to some initial probability measure. This paper investigates the relation between stochastic and set-based relations through the support function of probabilities. Page 1 The Converse of a Probabilistic Relation

[1]  Editors , 1986, Brain Research Bulletin.

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

[3]  E. Michael.  Topologies on spaces of subsets , 1951 .

[4]  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).

[5]  Domenico Cantone,et al.  Set Theory for Computing , 2001, Monographs in Computer Science.

[6]  P. Panangaden.  Probabilistic Relations , 1998 .

[7]  Ernst-Erich Doberkat.  Nondeterminism of stochastic automata: An etude in measurable selections , 1981 .

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

[9]  C. Castaing,et al.  Convex analysis and measurable multifunctions , 1977 .

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

[11]  E. Schröder.  Vorlesungen über die Algebra der Logik (Exakte Logik) , 1966 .

[12]  S. Lane.  Categories for the Working Mathematician , 1971 .