Oxford logo
[KNPQ13] M. Kwiatkowska, G. Norman, D. Parker and H. Qu. Compositional Probabilistic Verification through Multi-Objective Model Checking. Information and Computation, 232, pages 38-65, Elsevier. November 2013. [pdf] [bib]
Downloads:  pdf pdf (472 KB)  bib bib
Notes: This is an extended version of [KNPQ10], with additional assume-guarantee rules and full proofs.
Abstract. Compositional approaches to verification offer a powerful means to address the challenge of scalability. In this paper, we develop techniques for compositional verification of probabilistic systems based on the assume-guarantee paradigm. We target systems that exhibit both nondeterministic and stochastic behaviour, modelled as probabilistic automata, and augment these models with costs or rewards to reason about, for example, energy usage or performance metrics. Despite significant theoretical advances in compositional reasoning for probabilistic automata, there has been a distinct lack of practical progress regarding automated verification. We propose a new assume-guarantee framework based on multi-objective probabilistic model checking which supports compositional verification for a range of quantitative properties, including probabilistic omega-regular specifications and expected total cost or reward measures. We present a wide selection of assume-guarantee proof rules, including asymmetric, circular and asynchronous variants, and also show how to obtain numerical results in a compositional fashion. Given appropriate assumptions to be used in the proof rules, our compositional verification methods are, in contrast to previously proposed approaches, efficient and fully automated. Experimental results demonstrate their practical applicability on several large case studies, including instances where conventional probabilistic verification is infeasible.