Acta Informatica

, Volume 39, Issue 5, pp 315–389

Reasoning about probabilistic sequential programs in a probabilistic logic

Original article

DOI: 10.1007/s00236-003-0113-z

Cite this article as:
Ying, M. Acta Informatica (2003) 39: 315. doi:10.1007/s00236-003-0113-z
  • 48 Downloads

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.

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • M. Ying
    • 1
  1. 1.State Key Laboratory of Intelligent Technology and Systems, Department of Computer Science and Technology, Tsinghua University, Beijing 100084, China (e-mail: yingmsh@tsinghua.edu.cn) CN
  2. 2. Turku Center for Computer Science (TUCS), Software Construction Laboratory, Data City, Lemminkäisenkatu 14A, FIN-20520 Turku, Finland FI