Research Catalog

Title

Abstraction, refinement and proof for probabilistic systems / Annabelle McIver, Carroll Morgan.

Author

McIver, Annabelle.

Publication

New York : Springer, ©2005.

Items in the Library & Off-site

Details

Additional Authors

Morgan, Carroll, 1952-

Description

xix, 383 pages : illustrations; 24 cm

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."--Jacket.

Series Statement

Monographs in computer science

Uniform Title

Monographs in computer science.

Subject

• Engineering mathematics
• Probabilities
• Systems engineering
• Probability
• probability
• systems engineering

Bibliography (note)

• Includes bibliographical references (p. [345]-355) and indexes.

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.

ISBN

• 0387401156
• 9780387401157
• 1441923128
• 9781441923127
• 9780387270067
• 038727006X

LCCN

• 2004057839
• 9780387401157

OCLC

• ocm56615822
• 56615822
• SCSB-9147494

Owning Institutions

Princeton University Library