[Kwi03] M. Kwiatkowska. Model Checking for Probability and Time: From Theory to Practice. In Proc. 18th IEEE Symposium on Logic in Computer Science (LICS'03), pages 351-360, IEEE CS Press. Invited paper. June 2003. [ps.gz] [pdf] [bib]
Downloads:  ps.gz ps.gz (164 KB)  pdf pdf (242 KB)  bib bib
Links: [Google] [Google Scholar]
Abstract. Probability features increasingly often in software and hardware systems: it is used in distributed co-ordination and routing problems, to model fault-tolerance and performance, and to provide adaptive resource management strategies. Probabilistic model checking is an automatic procedure for establishing if a desired property holds in a probabilistic model, aimed at verifying probabilistic specifications such as 'leader election is eventually resolved with probability 1', 'the chance of shutdown occurring is at most 0.01%', and 'the probability that a message will be delivered within 30ms is at least 0.75'. A probabilistic model checker calculates the probability of a given temporal logic property being satisfied, as opposed to validity. In contrast to conventional model checkers, which rely on reachability analysis of the underlying transition system graph, probabilistic model checking additionally involves numerical solutions of linear equations and linear programming problems. This paper reports our experience with implementing PRISM, a Probabilistic Symbolic Model Checker, demonstrates its usefulness in analysing real-world probabilistic protocols, and outlines future challenges for this research direction.