Quantitative program logic and expected time bounds in probabilistic distributed algorithms

Theoretical Computer Science

Volumn 282, Issue 1, 2002, Pages 191-219

  McIver, A K ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING; DISTRIBUTED COMPUTER SYSTEMS; PROBABILITY DISTRIBUTIONS;

PROGRAM LOGIC;

PROBABILISTIC LOGICS;

EID: 0037036275     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(01)00049-4     Document Type: Conference Paper

References (24)

1. The temporal logic of branching time
2. Temporal logics for the specification of performance and reliability
3. Computing minimum and maximum reachability times in probabilistic systems
4. From fairness to chance
5. A logic for reasoning about time and probability
6. Probabilistic models for the guarded command language
7. A probabilistic PDL
8. Results on the propositional μ-calculus
9. On the advantages of free choice: A symmetric and fully-distributed solution to the Dining Philosophers Problem
10. Reasoning about efficiency within a probabilistic mu-calculus
11. A probabilistic temporal calculus based on expectations
12. Probabilistic predicate transformers
13. Proving time bounds for randomized distributed algorithms
14. Verification of multiprocess probabilistic protocols
15. Analyzing expected time by scheduler-luck games
16. Verification of probabilistic programs
17. Local model checking games
18. Automatic varification of probabilistic concurrent finite state programs