Predicate Transformers for Extended Probability and Non-determinism

Resource type
Authors/contributors
Title
Predicate Transformers for Extended Probability and Non-determinism
Abstract
We investigate laws for predicate transformers for the combination of non-deterministic choice and (extended) probabilistic choice, where predicates are taken to be functions to the extended non-negative reals, or to closed intervals of such reals. These predicate transformers correspond to state transformers, which are functions to conical powerdomains, which are the appropriate powerdomains for the combined forms of non-determinism. As with standard powerdomains for non-deterministic choice, these come in three flavours – lower, upper and (order-)convex – so there are also three kinds of predicate transformers. In order to make the connection, the powerdomains are first characterised in terms of relevant classes of functionals. Much of the development is carried out at an abstract level, a kind of domain-theoretic functional analysis: one considers d-cones, which are dcpos equipped with a module structure over the non-negative extended reals, in place of topological vector spaces. Such a development still needs to be carried out for probabilistic choice per se; it would presumably be necessary to work with a notion of convex space rather than a cone.
Publication
Mathematical. Structures in Comp. Sci.
Volume
19
Issue
3
Pages
501–539
Date
June 2009
DOI
10/bkvgqc
ISSN
0960-1295
Accessed
2019-11-26T20:33:27Z
Library Catalog
ACM Digital Library
Extra
ZSCC: 0000015
Citation
Keimel, K., & Plotkin, G. d. (2009). Predicate Transformers for Extended Probability and Non-determinism. Mathematical. Structures in Comp. Sci., 19(3), 501–539. https://doi.org/10/bkvgqc
Processing time: 0.02 seconds

Graph of references

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