Abstraction, Refinement and Proof for Probabilistic Systems
1st Edition
Published on 27. October 2005
XX, 388 pages
978-0-387-27006-7 (ISBN)
Description
Illustrates by example the typical steps necessary in computer science to build a mathematical model of any programming paradigm .
Presents results of a large and integrated body of research in the area of 'quantitative' program logics.
More details
Other editions
Additional editions
Annabelle McIver | Charles Carroll Morgan
Abstraction, Refinement and Proof for Probabilistic Systems
Book
11/2004
Springer
€160.49
Shipment within 5-7 days
Content
Probabilistic guarded commands and their refinement logic.- to pGCL: Its logic and its model.- Probabilistic loops: Invariants and variants.- Case studies in termination: Choice coordination, the dining philosophers, and the random walk.- Probabilistic data refinement: The steam boiler.- Semantic structures.- Theory for the demonic model.- The geometry of probabilistic programs.- Proved rules for probabilistic loops.- Infinite state spaces, angelic choice and the transformer hierarchy.- Advanced topics: Quantitative modal logic and game interpretations.- Quantitative temporal logic: An introduction.- The quantitative algebra of qTL.- The quantitative modal ?-calculus, and gambling games.
