Semantic Domains for Combining Probability and Non-Determinism

Resource type
Authors/contributors
Title
Semantic Domains for Combining Probability and Non-Determinism
Abstract
We present domain-theoretic models that support both probabilistic and nondeterministic choice. In [36], Morgan and McIver developed an ad hoc semantics for a simple imperative language with both probabilistic and nondeterministic choice operators over a discrete state space, using domain-theoretic tools. We present a model also using domain theory in the sense of D.S. Scott (see e.g. [15]), but built over quite general continuous domains instead of discrete state spaces.
Publication
Electronic Notes in Theoretical Computer Science
Volume
222
Pages
3-99
Date
02/2009
Language
en
DOI
10/d9hwq7
ISSN
15710661
Accessed
2019-11-26T19:01:09Z
Library Catalog
Crossref
Extra
ZSCC: 0000055
Citation
Tix, R., Keimel, K., & Plotkin, G. (2009). Semantic Domains for Combining Probability and Non-Determinism. Electronic Notes in Theoretical Computer Science, 222, 3–99. https://doi.org/10/d9hwq7
Processing time: 0.04 seconds

Graph of references

(from Zotero to Gephi via Zotnet with this script)
Graph of references