A Minkowski type duality mediating between state and predicate transformer semantics for a probabilistic nondeterministic language
DOI10.1016/J.APAL.2008.06.020zbMath1167.68034OpenAlexW2006166370MaRDI QIDQ1023294
A. Rosenbusch, Klaus Keimel, Thomas Streicher
Publication date: 11 June 2009
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apal.2008.06.020
Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Convex sets in topological vector spaces (aspects of convex geometry) (52A07) Continuous lattices and posets, applications (06B35)
Related Items (3)
Cites Work
- Unnamed Item
- Unnamed Item
- Retracted: Semantic domains for combining probability and non-determinism
- Support functions of convex compacta
- Domain-Theoretic Foundations of Functional Programming
- Predicate transformers for extended probability and non-determinism
- Abstraction, Refinement and Proof for Probabilistic Systems
- Continuous Lattices and Domains
- Demonic, angelic and unbounded probabilistic choices in sequential programs
- Partial correctness for probabilistic demonic programs
This page was built for publication: A Minkowski type duality mediating between state and predicate transformer semantics for a probabilistic nondeterministic language