Demonic, angelic and unbounded probabilistic choices in sequential programs
From MaRDI portal
Publication:5925822
DOI10.1007/s002360000046zbMath0971.68027MaRDI 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
68N19: Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.)
Related Items
Isomorphism theorems between models of mixed choice, Partial correctness for probabilistic demonic programs, Full abstraction for non-deterministic and probabilistic extensions of PCF. I: The angelic cases, Algebraic reasoning for probabilistic action systems and while-loops, A Minkowski type duality mediating between state and predicate transformer semantics for a probabilistic nondeterministic language, Almost-certain eventualities and abstract probabilities in the quantitative temporal logic qTL, Quantitative solution of omega-regular games, Ensuring liveness properties of distributed systems: open problems, Predicate transformers for extended probability and non-determinism