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 a potential application of our model to aspects of security.
Partial support provided by the National Science Foundation and the US Office of Naval Research
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
S. Abramsky and A. Jung, Domain Theory, In: S. Abramsky, D. M. Gabbay and T. S. E. Maibaum, editors, Handbook of Logic and Computer Science, 3, Clarendon Press (1994), pp. 1–168.
P. America and J. J. R. R. Rutten, Solving reflexive domains equations in a category of complete metric spaces, Journal of Computer Systems and Sciences 39 (1989), pp. 343–375.
S.D. Brookes and A. W. Roscoe, An improved failures model for communicating processes, Lecture Notes in Computer Science 197 (1985), pp. 281–305.
E. P. de Vink and J. J. M. M. Rutten, Bisimulation for probabilistic transition systems: a coalgebraic approach, CWI preprint, October, 1998.
H. Hansson and B. Jonsson, A calculus for communicating systems with time and probability, Proceedings of the 11th Symposium on Real Time Systems, 1990.
J. I. den Hartog and E. P. de Vink, Mixing up nondeterminism and probability: A preliminary report, Electronic Notes in Theoretical Computer Science 22 (1997), URL: http://www.elsevier.nl/locate/entcs/volume22.html.
R. Heckmann, Probabilistic domains, Proceedings of CAAP’ 94, Lecture Notes in Computer Science 787 (1994), pp. 142–156.
M. Hennessy and G. Plotkin, Full abstraction for a simple parallel programming language, Lecture Notes in Computer Science 74 (1979), Springer-Verlag.
C. Jones, “Probabilistic Non-determinism,” PhD Thesis, University of Edinburgh, 1990. Also published as Technical Report No. CST-63-90.
C. Jones and G. Plotkin, A probabilistic powerdomain of evaluations, Proceedings of 1989 Symposium on Logic in Computer Science, IEEE Computer Society Press, 1989, pp. 186–195.
A. Jung, Lawson-compactness for the probabilistic powerdomain, Preprint, 1997.
A. Jung and R. Tix, The troublesome probabilistic powerdomain, Electronic Notes in Theoretical Computer Science 13 (1998), URL: http://www.elsevier.nl/locate/entcs/volume13.html.
J. D. Lawson, Valuations on continuous lattices, In: Rudolf-Eberhard Hoffmann, editor, Continuous Lattices and Related Topics, Mathematik Arbeitspapiere 27 (1982), Universität Bremen, pp. 204–225.
K. Larsen and A. Skou, Bisimulation through probabilistic testing, Information and Computation 94 (1991), pp. 456–471.
G. Lowe, “Probabilities and Priorities in Timed CSP,” DPhil Thesis, University of Oxford, 1991.
N. Lynch and R. Segala, Probabilistic simulations for probabilistic processes, Proceedings of CONCUR’94, Lecture Notes in Computer Science 836 (1994), pp. 481–496.
C. Morgan, A. McIver, K. Seidel and J. Sanders, Refinement-oriented probability for CSP, University of Oxford Technical Report, 1994.
C. Morgan, A. McIver, K. Seidel and J. Sanders, Argument duplication in probabilistic CSP, University of Oxford Technical Report, 1995.
A. W. Roscoe. CSP and determinism in security modeling. In IEEE Symposium on Security and Privacy. IEEE Computer Society Press, 1995.
J. J. M. M. Rutten and D. Turi, On the foundations of final semantics: Non-standard sets, metric spaces and partial orders, Proceedings of the REX’92 Workshop, Lecture Notes in Computer Science 666 (1993), pp. 477–530.
N. Saheb-Djahromi, CPOs of measures for nondeterminism, Theoretical Computer Science 12 (1980), pp. 19–37.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mislove, M. (2000). Nondeterminism and Probabilistic Choice: Obeying the Laws. In: Palamidessi, C. (eds) CONCUR 2000 — Concurrency Theory. CONCUR 2000. Lecture Notes in Computer Science, vol 1877. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44618-4_26
Download citation
DOI: https://doi.org/10.1007/3-540-44618-4_26
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67897-7
Online ISBN: 978-3-540-44618-7
eBook Packages: Springer Book Archive