Abstraction, Refinement and Proof for Probabilistic Systems
Erschienen am 19. November 2004
Buch
Hardcover
XX, 388 Seiten
978-0-387-40115-7 (ISBN)
Beschreibung
This book integrates coverage of random/probabilistic algorithms, assertion-based program reasoning, and refinement programming models, providing a highly focused survey on probabilistic program semantics. It illustrates by example the typical steps necessary in computer science to build a mathematical model of any programming paradigm, addressing an essential foundation topic for modern sequential programming methodology.
Weitere Details
Reihe
Auflage
2005 ed.
Sprache
Englisch
Verlagsort
New York
USA
Zielgruppe
Für Beruf und Forschung
Research
Produkt-Hinweis
Fadenheftung
Gewebe-Einband
Illustrationen
63 s/w Abbildungen
XX, 388 p. 63 illus.
Maße
Höhe: 243 mm
Breite: 164 mm
Dicke: 25 mm
Gewicht
734 gr
ISBN-13
978-0-387-40115-7 (9780387401157)
DOI
10.1007/b138392
Schweitzer Klassifikation
Weitere Ausgaben
Inhalt
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.