Abstraction, Refinement and Proof for Probabilistic Systems

Authors:

ISBN: 978-0-387-40115-7 (Print) 978-0-387-27006-7 (Online)

Table of contents (11 chapters)

  1. Front Matter

    Pages i-xix

  2. Probabilistic guarded commands and their refinement logic

    1. No Access

      Book Chapter

      Pages 3-36

      Introduction to pGCL: Its logic and its model

    2. No Access

      Book Chapter

      Pages 37-78

      Probabilistic loops: Invariants and variants

    3. No Access

      Book Chapter

      Pages 79-106

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

    4. No Access

      Book Chapter

      Pages 107-125

      Probabilistic data refinement: The steam boiler

  3. Semantic structures

    1. No Access

      Book Chapter

      Pages 129-164

      Theory for the demonic model

    2. No Access

      Book Chapter

      Pages 165-180

      The geometry of probabilistic programs

    3. No Access

      Book Chapter

      Pages 181-216

      Proved rules for probabilistic loops

    4. No Access

      Book Chapter

      Pages 217-242

      Infinite state spaces, angelic choice and the transformer hierarchy

  4. Advanced topics: Quantitative modal logic and game interpretations

    1. No Access

      Book Chapter

      Pages 245-263

      Quantitative temporal logic: An introduction

    2. No Access

      Book Chapter

      Pages 265-291

      The quantitative algebra of qTL

    3. No Access

      Book Chapter

      Pages 293-310

      The quantitative modal μ-calculus, and gambling games

  5. Back Matter

    Pages 311-383