by Michael Mislove
In Proc. 11th CONCUR, volume 1877 of LNCS
http://www.math.tulane.edu/ftp/pub/mwm/concur.ps
Add To MetaCart
Abstract:
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 satises 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 modied 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. 1
Citations
|
330
|
Bisimulation through probabilistic testing
– Larsen, Skou
- 1991
|
|
185
|
Probabilistic simulations for probabilistic processes
– Segala, Lynch
|
|
109
|
Probabilistic Non-determinism
– Jones
- 1990
|
|
102
|
A domain equation for bisimulation
– Abramsky
- 1991
|
|
102
|
A probabilistic powerdomain of evaluations
– Jones, Plotkin
- 1989
|
|
89
|
A calculus for communicating systems with time and probabilities
– Hansson, Jonsson
- 1990
|
|
87
|
Full abstraction for a simple parallel programming language
– Hennessy, Plotkin
- 1979
|
|
63
|
Bisimulation for probabilistic transition systems: A coalgebraic approach
– Vink, Rutten
- 1999
|
|
62
|
An improved failures model for communicating processes
– Brookes, Roscoe
- 1985
|
|
62
|
CSP and determinism in security modelling
– Roscoe
|
|
28
|
Refinement-oriented probability for CSP
– Morgan, McIver, et al.
- 1996
|
|
25
|
The Troublesome Probabilistic Powerdomain
– Jung, Tix
- 1998
|
|
20
|
Valuations on continuous lattices
– Lawson
- 1982
|
|
19
|
Probabilistic domains
– Heckmann
- 1994
|
|
15
|
Domain Equations for Probabilistic Processes
– Baier, Kwiatkowska
- 1997
|
|
15
|
Probabilities and priorities in timed CSP
– Lowe
- 1993
|
|
8
|
Solving re domain equations in a category of complete metric spaces
– America, Rutten
- 1989
|
|
5
|
domain theory and theoretical computer science
– Mislove, Topology
- 1998
|
|
5
|
Argument duplication in probabilistic CSP
– Morgan, McIver, et al.
- 1995
|
|
5
|
On the foundations of semantics: Nonstandard sets, metric spaces, partial orders
– Rutten, Turi
- 1993
|
|
3
|
Cpo's of measures for nondeterminism, Theoretical Computer Science 12
– Saheb-Djahromi
- 1980
|
|
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
|
