Advertisement

Acta Informatica

, Volume 37, Issue 4–5, pp 329–354 | Cite as

Demonic, angelic and unbounded probabilistic choices in sequential programs

  • A.K. McIver
  • C. Morgan
Original articles

Abstract.

Probabilistic predicate transformers extend standard predicate transformers by adding probabilistic choice to (transformers for) sequential programs; demonic nondeterminism is retained. For finite state spaces, the basic theory is set out elsewhere [17], together with a presentation of the probabilistic ‘healthiness conditions’ that generalise the ‘positive conjunctivity’ of ordinary predicate transformers.

Here we expand the earlier results beyond ordinary conjunctive transformers, investigating the structure of the transformer space more generally: as Back and von Wright [1] did for the standard (non-probabilistic) case, we nest deterministic, demonic and demonic/angelic transformers, showing how each subspace can be constructed from the one before. We show also that the results hold for infinite state spaces.

In the end we thus find characteristic healthiness conditions for the hierarchies of a system in which deterministic, demonic, probabilistic and angelic choices all coexist.

Keywords

State Space Early Result Basic Theory Healthiness Condition Probabilistic Choice 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • A.K. McIver
    • 1
  • C. Morgan
    • 1
  1. 1.Programming Research Group, Oxford University, 8-11 Keble Rd., Oxford OX1 3QD, United Kingdom (e-mail: anabel@comlab.ox.ac.uk, carrollm@unsw.edu.au)GB

Personalised recommendations