The Probabilistic Model Checking Landscape

Randomization is a key element in sequential and distributed computing. Reasoning about randomized algorithms is highly non-trivial. In the 1980s, this initiated first proof methods, logics, and model-checking algorithms. The field of probabilistic verification has developed considerably since then....

Full description

Saved in:
Bibliographic Details
Published inProceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science pp. 31 - 45
Main Author Katoen, Joost-Pieter
Format Conference Proceeding
LanguageEnglish
Published New York, NY, USA ACM 05.07.2016
SeriesACM Conferences
Subjects
Hardware > Robustness
Mathematics of computing > Probability and statistics
Theory of computation > Logic
Theory of computation > Semantics and reasoning
Theory of computation > Semantics and reasoning > Program reasoning
model checking
Markov decision processes
abstraction
probabilistic logics
Markov chains
fault trees
parameter synthesis
applications
Online AccessGet full text
ISBN9781450343916
1450343910
DOI10.1145/2933575.2934574

Cover

More Information
Summary:Randomization is a key element in sequential and distributed computing. Reasoning about randomized algorithms is highly non-trivial. In the 1980s, this initiated first proof methods, logics, and model-checking algorithms. The field of probabilistic verification has developed considerably since then. This paper surveys the algorithmic verification of probabilistic models, in particular probabilistic model checking. We provide an informal account of the main models, the underlying algorithms, applications from reliability and dependability analysis---and beyond---and describe recent developments towards automated parameter synthesis.
ISBN:9781450343916
1450343910
DOI:10.1145/2933575.2934574