Abstraction, refinement and proof for probabilistic systems
著者
書誌事項
Abstraction, refinement and proof for probabilistic systems
（Monographs in computer science）
Springer, c2005
大学図書館所蔵 件 / 全8件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
Includes bibliographical references (p. [345]-355) and indexes
内容説明・目次
内容説明
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.
目次
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.
「Nielsen BookData」 より