Abstraction, Refinement and Proof for Probabilistic Systems

2005 | Buch

Kapitel lesen Erstes Kapitel lesen

Abstraction, Refinement and Proof for Probabilistic Systems

verfasst von: Annabelle McIver, Carroll Morgan

Verlag: Springer New York

Buchreihe : Monographs in Computer Science

Enthalten in: Springer Professional "Wirtschaft+Technik" , Springer Professional "Technik" , Springer Professional "Wirtschaft"

Einloggen, um Zugang zu erhalten

Anzeige

Inhaltsverzeichnis

Frontmatter

Probabilistic guarded commands and their refinement logic

1. Introduction to pGCL: Its logic and its model

2. Probabilistic loops: Invariants and variants

3. Case studies in termination: Choice coordination, the dining philosophers, and the random walk

4. Probabilistic data refinement: The steam boiler

Semantic structures

5. Theory for the demonic model

6. The geometry of probabilistic programs

7. Proved rules for probabilistic loops

8. Infinite state spaces, angelic choice and the transformer hierarchy

Advanced topics: Quantitative modal logic and game interpretations

9. Quantitative temporal logic: An introduction

10. The quantitative algebra of qTL

11. The quantitative modal μ-calculus, and gambling games

Backmatter

Titel: Abstraction, Refinement and Proof for Probabilistic Systems
verfasst von: Annabelle McIver
Carroll Morgan
Copyright-Jahr: 2005
Verlag: Springer New York
Electronic ISBN: 978-0-387-27006-7
Print ISBN: 978-0-387-40115-7
DOI: https://doi.org/10.1007/b138392