Oxford logo
[FKP+12] V. Forejt, M. Kwiatkowska, D. Parker, H. Qu and M. Ujma. Incremental Runtime Verification of Probabilistic Systems. In S. Qadeer and S. Tasiran (editors), Proc. 3rd International Conference on Runtime Verification (RV'12), volume 7687 of LNCS, pages 314-319, Springer. September 2012. [pdf] [bib]
Downloads:  pdf pdf (227 KB)  bib bib
Notes: An extended version of this paper can be found in [FKP+12b]. The original publication is available at link.springer.com.
Abstract. Probabilistic verification techniques have been proposed for runtime analysis of adaptive software systems, with the verification results being used to steer the system so that it satisfies certain Quality of Service requirements. Since systems evolve over time, and verification results are required promptly, efficiency is an essential issue. To address this, we present incremental verification techniques, which exploit the results of previous analyses. We target systems modelled as Markov decision processes, developing incremental methods for constructing models from high-level system descriptions and for numerical solution using policy iteration based on strongly connected components. A prototype implementation, based on the PRISM model checker, demonstrates performance improvements on a range of case studies.