Local Model Checking of Weighted CTL with Upper-Bound Constraints

Jonas Finnemann Jensen, Kim Guldstrand Larsen, Jiri Srba, Lars Østergaard

Publikation: Bidrag til bog/antologi/rapport/konference proceedingKonferenceartikel i proceedingForskningpeer review

7 Citationer (Scopus)


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”.
TitelModel Checking Software : 20th International Symposium, SPIN 2013, Stony Brook, NY, USA, July 8-9, 2013. Proceedings
RedaktørerEzio Bartocci, C. R. Ramakrishnan
Antal sider18
ForlagSpringer Publishing Company
ISBN (Trykt)978-3-642-39175-0
StatusUdgivet - 2013
BegivenhedInternational SPIN Symposium on Model Checking of Software - Stony Brook, Stony Brook, NY, USA
Varighed: 8 jul. 20139 jul. 2013
Konferencens nummer: 20


KonferenceInternational SPIN Symposium on Model Checking of Software
LokationStony Brook
ByStony Brook, NY
NavnLecture Notes in Computer Science

Fingeraftryk Dyk ned i forskningsemnerne om 'Local Model Checking of Weighted CTL with Upper-Bound Constraints'. Sammen danner de et unikt fingeraftryk.