Skip to main content
Log in

Demonic, angelic and unbounded probabilistic choices in sequential programs

  • Original articles
  • Published:
Acta Informatica Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received: 10 November 1998 / 7 September 2000

Rights and permissions

Reprints and permissions

About this article

Cite this article

McIver, A., Morgan, C. Demonic, angelic and unbounded probabilistic choices in sequential programs. Acta Informatica 37, 329–354 (2001). https://doi.org/10.1007/s002360000046

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s002360000046

Keywords

Navigation