On-the-fly Probabilistic Model Checking

Diego Latella
Michele Loreti
(Università di Firenze)
Mieke Massink

Model checking approaches can be divided into two broad categories: global approaches that determine the set of all states in a model M that satisfy a temporal logic formula f, and local approaches in which, given a state s in M, the procedure determines whether s satisfies f. When s is a term of a process language, the model checking procedure can be executed ``on-the-fly'', driven by the syntactical structure of s. For certain classes of systems, e.g. those composed of many parallel components, the local approach is preferable because, depending on the specific property, it may be sufficient to generate and inspect only a relatively small part of the state space. We propose an efficient, on-the-fly, PCTL model checking procedure that is parametric with respect to the semantic interpretation of the language. The procedure comprises both bounded and unbounded until modalities. The correctness of the procedure is shown and its efficiency is compared with a global PCTL model checker on representative applications.

In Ivan Lanese, Alberto Lluch Lafuente, Ana Sokolova and Hugo Torres Vieira: Proceedings 7th Interaction and Concurrency Experience (ICE 2014), Berlin, Germany, 6th June 2014, Electronic Proceedings in Theoretical Computer Science 166, pp. 45–59.
The research presented in this paper has been partially funded by the EU projects ASCENS (nr.257414) and QUANTICOL (nr.600708), and by the Italian MIUR PRIN project CINA (2010LHT4KM).
Published: 26th October 2014.

ArXived at: http://dx.doi.org/10.4204/EPTCS.166.6 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org