Abstraction, Refinement and Proof for Probabilistic Systems

• Κύριοι συγγραφείς: McIver, Annabelle (Συγγραφέας), Morgan, Carroll (Συγγραφέας)
• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: New York, NY : Springer New York, 2005.
• Σειρά: Monographs in Computer Science,
• Θέματα: Computer science.; Software engineering.; Computer programming.; Programming languages (Electronic computers).; Computer logic.; Mathematical logic.; Probabilities.; Computer Science.; Software Engineering/Programming and Operating Systems.; Probability Theory and Stochastic Processes.; Programming Techniques.; Logics and Meanings of Programs.; Programming Languages, Compilers, Interpreters.; Mathematical Logic and Formal Languages.

Probabilistic techniques are increasingly being employed in computer programs and systems because they can increase efficiency in sequential algorithms, enable otherwise nonfunctional distribution applications, and allow quantification of risk and safety in general. This makes operational models of...

Πίνακας περιεχομένων:

• 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.