Models Supporting Nondeterminism and Probabilistic Choice

Authors:
Michael W. Mislove
Affiliations:
-
Venue:
IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
Year:
2000

Citing 7
Cited 0

A probabilistic powerdomain of evaluations

Proceedings of the Fourth Annual Symposium on Logic in computer science
Probabilistic non-determinism

Probabilistic non-determinism
Domain theory

Handbook of logic in computer science (vol. 3)
Domain equations for probabilistic processes

Theoretical Computer Science
An Improved Failures Model for Communicating Processes

Seminar on Concurrency, Carnegie-Mellon University
On the Foundation of Final Semantics: Non-Standard Sets, Metric Spaces, Partial Orders

Proceedings of the REX Workshop on Sematics: Foundations and Applications
Probabilistic Domains

CAAP '94 Proceedings of the 19th International Colloquium on Trees in Algebra and Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we describe the problems encountered in building a semantic model that supports 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 a model can be devised "on top of" certain models for probabilistic choice, so that the expected laws for nondeterministic choice and probabilistic choice remain valid.