On-the-Fly Model Checking for Extended Action-Based Probabilistic Operators

Radu Mateescu and José Ignacio Requeno

Proceedings of the 23rd International SPIN Symposium on Model Checking of Software (SPIN 2016), Eindhoven, The Netherlands, April 2016

This conference paper has been superseded by a journal article.

Abstract:

The quantitative analysis of concurrent systems requires expressive and user-friendly property languages combining temporal, data-handling, and quantitative aspects. In this paper, we aim at facilitating the quantitative analysis of systems modeled as PTSs (Probabilistic Transition Systems) labeled by actions containing data values and probabilities. We propose a new regular probabilistic operator that computes the probability measure of a path specified by a generalized regular formula involving arbitrary computations on data values. This operator, which subsumes the Until operators of PCTL and their action-based counterparts, can provide useful quantitative information about paths having certain (e.g., peak) cost values. We integrated the regular probabilistic operator into MCL (Model Checking Language) and we devised an associated on-the-fly model checking method, based on a combined local resolution of linear and Boolean equation systems. We implemented the method in the EVALUATOR model checker of the CADP toolbox and experimented it on realistic PTSs modeling concurrent systems.

18 pages

PDF

PostScript

Slides of R. Mateescu's lecture at SPIN 2016

PDF