Publication details
Efficient Model Checking of Weighted CTL with Upper-Bound Constraints
| Authors | |
|---|---|
| Year of publication | 2016 |
| Type | Article in Periodical |
| Magazine / Source | International Journal on Software Tools for Technology Transfer (STTT) |
| MU Faculty or unit | |
| Citation | |
| Web | Link to publisher |
| Doi | http://dx.doi.org/10.1007/s10009-014-0359-5 |
| Field | Informatics |
| Keywords | CTL model checking; Kripke structure; on-the-fly algorithms; dependency graph |
| Description | We present a symbolic extension of dependency graphs by Liuand Smolka in order to model-check weighted Kripke structures againstthe logic CTL with upper-bound weight constraints. Our extension introducesa new type of edges into dependency graphs and lifts the computation offixed-points from boolean domain to nonnegative integers in order to copewith the weights. We present both global and local algorithms for thefixed-point computation on symbolic dependency graphs and argue for theadvantages of our approach compared to the direct encoding of the modelchecking problem into dependency graphs. We implement all algorithmsin a publicly available tool prototype and evaluate them on severalexperiments. The principal conclusion is that our local algorithm isthe most efficient one with an order of magnitude improvement formodel checking problems with a high number of `witnesses'. |