Abstraction, refinement, and proof for probabilistic systems

Type Book

Rate 0.0 /5

"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

Details

Files

Reviews

Download

Title Statements

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

Summary

Edition Statements

Publication Date:2004.

Publication Statements

Publisher(s):Springer
Place of Publication:New York
Language:eng
Publication Date:2004.

The Physical Object

Description:xix, 383 pages ; : 24 cm

Edition Identifiers

ISBN:0387401156, 9780387401157
oclc:on1058057062
LC Classification:TA340
Dewey Decimal:005.1

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.

Subjects

COMPUTERS -- Programming COMPUTERS -- Software Development & Eng… Engineering mathematics Informatique Ingénierie des systèmes Mathématiques de l'ingénieur Probabilités Probabilities PROBABILITY systems engineering