Reasoning about efficiency within a probabilistic μ-calculus
<p>Expectation-based probabilistic predicate transformers [15] provide a logic for probabilistic sequential programs, giving access to expressions such as &apos;the probability that predicate <em>A</em> is achieved finally&apos;. Using expectations more generally ho...
Main Author: | McIver, A |
---|---|
Format: | Journal article |
Language: | English |
Published: |
1999
|
Subjects: |
Similar Items
-
Reasoning about efficiency within a probabilistic calculus
by: McIver, A
Published: (1999) -
Quantitative program logic and expected time bounds in probabilistic distributed algorithms
by: McIver, A
Published: (2002) -
Partial correctness for probabilistic demonic programs
by: McIver, A, et al.
Published: (2001) -
Probabilistic guarded commands mechanized in HOL
by: Hurd, J, et al.
Published: (2005) -
Qualitative and Probabilistic Uncertainty in Reasoning about Actions with Sensing
by: Iocchi, L, et al.
Published: (2004)