Abstraction, Refinement and Proof for Probabilistic Systems

TRAMA

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.

SOMMARIO

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.

ALTRE INFORMAZIONI

• Condizione: Nuovo
• ISBN: 9781441923127
• Collana: Monographs in Computer Science
• Dimensioni: 235 x 155 mm Ø 617 gr
• Formato: Brossura
• Illustration Notes: XX, 388 p. 63 illus.
• Pagine Arabe: 388
• Pagine Romane: xx