Local Model Checking of Weighted CTL with Upper-Bound Constraints

Warning

This publication doesn't include Faculty of Education. It includes Faculty of Informatics. Official publication website can be found on muni.cz.
Authors

JENSEN Jonas F. LARSEN Kim G. SRBA Jiří OESTERGAARD Lars K.

Year of publication 2013
Type Article in Proceedings
Conference Proceedings of International SPIN Symposium on Model Checking of Software (SPIN'13)
MU Faculty or unit

Faculty of Informatics

Citation
Doi http://dx.doi.org/10.1007/978-3-642-39176-7_12
Field Informatics
Keywords weigted CTL; model checking; Kripke structure; on-the-fly technique
Description We present a symbolic extension of dependency graphs by Liu and Smolka in order to model-check weighted Kripke structures against the logic CTL with upper-bound weight constraints. Our extension introduces a new type of edges into dependency graphs and lifts the computation of fixed-points from boolean domain to nonnegative integers in order to cope with the weights. We present both global and local algorithms for the fixed-point computation on symbolic dependency graphs and argue for the advantages of our approach compared to the direct encoding of the model checking problem into dependency graphs. We implement all algorithms in a publicly available tool prototype and evaluate them on several experiments. The principal conclusion is that our local algorithm is the most efficient one with an order of magnitude improvement for model checking problems with a high number of “witnesses”.
Related projects:

You are running an old browser version. We recommend updating your browser to its latest version.