Abstract.
We introduce a notion of strong monotonicity of probabilistic predicate transformers. This notion enables us to establish a normal form theorem for monotone probabilistic predicate transformers. Three other healthiness conditions, namely, conjunctivity, disjunctivity and continuity for probabilistic predicate transformers are also examined, and they are linked to strong monotonicity. A notion of probabilistic refinement index is proposed, and it provides us with a continuous strength spectrum of refinement relations which may be used to describe more flexible refinement between probabilistic programs. A notion of probabilistic correctness is introduced too. We give a probabilistic weakest-precondition, choice and game semantics to the contract language, and present a probabilistic generalization of the winning strategy theorem.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: 16 April 2002 / 20 January 2003
RID="a"
ID="a" This work was partly supported by the National Key Project for Fundamental Research of China (Grant No: 1998030905) and the National Foundation of Natural Sciences of China (Grant No: 60273003)
Rights and permissions
About this article
Cite this article
Ying, M. Reasoning about probabilistic sequential programs in a probabilistic logic. Acta Informatica 39, 315–389 (2003). https://doi.org/10.1007/s00236-003-0113-z
Issue Date:
DOI: https://doi.org/10.1007/s00236-003-0113-z