Abstraction, Refinement and Proof for Probabilistic Systems
Seiten
2004
Springer-Verlag New York Inc.
978-0-387-40115-7 (ISBN)
Springer-Verlag New York Inc.
978-0-387-40115-7 (ISBN)
Illustrates by example the typical steps necessary in computer science to build a mathematical model of any programming paradigm. This title presents results of a large and integrated body of research in the area of 'quantitative' program logics.
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.
| Reihe/Serie | Monographs in Computer Science |
|---|---|
| Zusatzinfo | 63 Illustrations, black and white; XX, 388 p. 63 illus. |
| Verlagsort | New York, NY |
| Sprache | englisch |
| Maße | 155 x 235 mm |
| Themenwelt | Mathematik / Informatik ► Informatik ► Software Entwicklung |
| Mathematik / Informatik ► Mathematik ► Wahrscheinlichkeit / Kombinatorik | |
| ISBN-10 | 0-387-40115-6 / 0387401156 |
| ISBN-13 | 978-0-387-40115-7 / 9780387401157 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
Mehr entdecken
aus dem Bereich
aus dem Bereich
Deterministische und randomisierte Algorithmen
Buch | Softcover (2024)
De Gruyter Oldenbourg (Verlag)
CHF 89,95
Programmieren erlernen und technische Fragestellungen lösen
Buch | Softcover (2023)
Springer Vieweg (Verlag)
CHF 62,95
