Abstract

In this paper we describe how to build semantic models that support both nondeterministic choice and probabilistic choice. Several models exist that support both of these constructs, but none that we know of satisfies all the laws one would like. Using domain-theoretic techniques, we show how models can be devised using the "standard model" for probabilistic choice, and then applying modified domain-theoretic models for nondeterministic choice. These models are distinguished by the fact that the expected laws for nondeterministic choice and probabilistic choice remain valid. We also describe some potential applications of our model to aspects of security.

Citations

371	A.: Bisimulation through Probabilistic Testing - Larsen, Skou - 1991
233	N.A.: Probabilistic simulations for probabilistic processes - Segala, Lynch - 1994
122	Probabilistic Non-determinism - Jones - 1990
115	A domain equation for bisimulation - Abramsky - 1991
108	G.: A probabilistic powerdomain of evaluations - Jones, Plotkin - 1989
88	A calculus for communicating systems with time and probabilities - Hansson, Jonsson - 1990
87	Full abstraction for a simple parallel programming language - Hennessy, Plotkin - 1979
73	CSP and determinism in security modelling - Roscoe - 1995
69	Bisimulation for probabilistic transition systems: A coalgebraic approach - Vink, Rutten - 1999
65	An improved failures model for communicating processes - Brookes, Roscoe - 1985
30	R.: The Troublesome Probabilistic Powerdomain - Jung, Tix - 1998
30	Refinement-oriented probability for CSP - Morgan, McIver, et al. - 1996
21	Probabilistic domains - Heckmann - 1994
18	Valuations on continuous lattices - Lawson - 1982
15	Domain equations for probabilistic processes - Baier, Kwiatkowska - 2000
15	Probabilities and priorities in timed csp - Lowe - 1999
8	Solving re domain equations in a category of complete metric spaces - America, Rutten - 1989
8	domain theory and theoretical computer science - Mislove, Topology - 1998
6	CPOs of measures for nondeterminism. Theoretical Computer Science - Saheb-Djahromi - 1980
5	Argument duplication in probabilistic CSP - Morgan, McIver, et al. - 1995
5	On the foundations of semantics: Nonstandard sets, metric spaces, partial orders - Turi, Rutten - 1998
1	CSP models, a process p re a process q if every behavior of p also is a behavior of q. That is, q is more nondeterministic than p. This notion is the basis of for reasoning about speci in CSP - Abramsky, Jung, et al. - 1994
1	de Vink, Mixing up nondeterminism and probability: A preliminary report - Hartog, P - 1997