Demonic, angelic and unbounded probabilistic choices in sequential programs
From MaRDI portal
Publication:5925822
DOI10.1007/s002360000046zbMath0971.68027OpenAlexW1999355680MaRDI QIDQ5925822
Annabelle McIver, Carroll Morgan
Publication date: 20 February 2001
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s002360000046
Related Items (9)
Quantitative solution of omega-regular games ⋮ Almost-certain eventualities and abstract probabilities in the quantitative temporal logic qTL ⋮ Isomorphism theorems between models of mixed choice ⋮ Full abstraction for non-deterministic and probabilistic extensions of PCF. I: The angelic cases ⋮ Algebraic reasoning for probabilistic action systems and while-loops ⋮ Ensuring liveness properties of distributed systems: open problems ⋮ Partial correctness for probabilistic demonic programs ⋮ Predicate transformers for extended probability and non-determinism ⋮ A Minkowski type duality mediating between state and predicate transformer semantics for a probabilistic nondeterministic language
This page was built for publication: Demonic, angelic and unbounded probabilistic choices in sequential programs
