Journal article icon

Journal article

Reasoning about efficiency within a probabilistic μ-calculus

Abstract:

Expectation-based probabilistic predicate transformers [15] provide a logic for probabilistic sequential programs, giving access to expressions such as 'the probability that predicate A is achieved finally'. Using expectations more generally however, we can express μ-calculus formulae for the expected path-length of a computation tree. Moreover within an expectation-based μ-calculus such efficiency measures and more conventional (but probabilistic) temporal operators [14] can be related.

Publication status:
Published
Peer review status:
Peer reviewed
Version:
Publisher's version

Actions


Access Document


Files:
Publisher copy:
10.1016/S1571-0661(05)80600-0

Authors


More by this author
Institution:
University of Oxford
Department:
Mathematical, Physical & Life Sciences Division - Department of Computer Science
Role:
Author
Journal:
Electronic Notes in Theoretical Computer Science Journal website
Volume:
22
Pages:
Pages 138–155
Publication date:
1999-01-01
DOI:
ISSN:
1571-0661
URN:
uuid:85b718f6-6672-4d41-bab1-61023957583f
Local pid:
ora:9824

Terms of use


Metrics


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP