,

Abstraction, Refinement and Proof for Probabilistic Systems

Specificaties
Gebonden, 388 blz. | Engels
Springer New York | 2005e druk, 2004
ISBN13: 9780387401157
Rubricering
Springer New York 2005e druk, 2004 9780387401157
Onderdeel van serie Monographs in Computer Science
€ 180,99
Levertijd ongeveer 8 werkdagen

Samenvatting

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.

Specificaties

ISBN13:9780387401157
Taal:Engels
Bindwijze:gebonden
Aantal pagina's:388
Uitgever:Springer New York
Druk:2005

Inhoudsopgave

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.
€ 180,99
Levertijd ongeveer 8 werkdagen

Rubrieken

    Personen

      Trefwoorden

        Abstraction, Refinement and Proof for Probabilistic Systems