| Description |
xix, 383 pages : illustrations ; 24 cm |
| Series |
Monographs in computer science |
|
Monographs in computer science.
|
| Contents |
Pt. I. Probabilistic guarded commands -- 1. Introduction to pGCL -- 2. Probabilistic loops : invariants and variants -- 3. Case studies in termination -- 4. Probabilistic data refinement : the steam boiler -- Pt. II. Semantic structures -- 5. Theory for the demonic model -- 6. The geometry of probabilistic programs -- 7. Proved rules for probabilistic loops -- 8. The transformer hierarchy -- Pt. III. Advanced topics -- 9. Quantitative temporal logic : an introduction -- 10. The quantitative algebra of qTL -- 11. The quantitative modal [mu]-calculus qM[mu], and games -- Pt. IV. Appendices, bibliography and indexes |
| Summary |
"Abstraction, Refinement and Proof for Probabilistic Systems presents a rigorous approach to modeling and reasoning about computer systems that incorporate probability. Its foundations lie in traditional Boolean sequential-program logic - but its extension to numeric rather than merely true-or-false judgments takes it much further, into areas such as randomized algorithms, fault tolerance and, in distributed systems, almost-certain symmetry breaking."--BOOK JACKET |
| Bibliography |
Includes bibliographical references (pages [345]-355) and indexes |
| Subject |
Engineering mathematics.
|
|
Probabilities.
|
|
Systems engineering.
|
| Author |
Morgan, Carroll, 1952-
|
| LC no. |
2004057839 |
| ISBN |
0387401156 alkaline paper |
|
0387401156 hardback alkaline paper |
|
