Other formats:
BibTeX
LaTeX
RIS
@inproceedings{1170297, author = {Jensen, Jonas F. and Larsen, Kim G. and Srba, Jiří and Oestergaard, Lars K.}, address = {Netherlands}, booktitle = {Proceedings of International SPIN Symposium on Model Checking of Software (SPIN'13)}, doi = {http://dx.doi.org/10.1007/978-3-642-39176-7_12}, editor = {Ezio Bartocci and C. R. Ramakrishnan}, keywords = {weigted CTL; model checking; Kripke structure; on-the-fly technique}, howpublished = {tištěná verze "print"}, language = {eng}, location = {Netherlands}, isbn = {978-3-642-39175-0}, pages = {178-195}, publisher = {Springer}, title = {Local Model Checking of Weighted CTL with Upper-Bound Constraints}, year = {2013} }
TY - JOUR ID - 1170297 AU - Jensen, Jonas F. - Larsen, Kim G. - Srba, Jiří - Oestergaard, Lars K. PY - 2013 TI - Local Model Checking of Weighted CTL with Upper-Bound Constraints PB - Springer CY - Netherlands SN - 9783642391750 KW - weigted CTL KW - model checking KW - Kripke structure KW - on-the-fly technique N2 - 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”. ER -
JENSEN, Jonas F., Kim G. LARSEN, Jiří SRBA and Lars K. OESTERGAARD. Local Model Checking of Weighted CTL with Upper-Bound Constraints. In Ezio Bartocci and C. R. Ramakrishnan. \textit{Proceedings of International SPIN Symposium on Model Checking of Software (SPIN'13)}. Netherlands: Springer, 2013, p.~178-195. ISBN~978-3-642-39175-0. Available from: https://dx.doi.org/10.1007/978-3-642-39176-7\_{}12.
|