Local Model Checking of Weighted CTL with Upper-Bound
Constraints

D 2013

Local Model Checking of Weighted CTL with Upper-Bound Constraints

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

Základní údaje

Originální název

Local Model Checking of Weighted CTL with Upper-Bound Constraints

Autoři

JENSEN, Jonas F. (208 Dánsko), Kim G. LARSEN (208 Dánsko), Jiří SRBA (203 Česká republika, garant, domácí) a Lars K. OESTERGAARD (208 Dánsko)

Vydání

Netherlands, Proceedings of International SPIN Symposium on Model Checking of Software (SPIN'13), od s. 178-195, 18 s. 2013

Nakladatel

Springer

Další údaje

Jazyk

angličtina

Typ výsledku

Stať ve sborníku

Obor

10201 Computer sciences, information science, bioinformatics

Stát vydavatele

Nizozemské království

Utajení

není předmětem státního či obchodního tajemství

Forma vydání

tištěná verze "print"

Impakt faktor

Impact factor: 0.402 v roce 2005

Kód RIV

RIV/00216224:14330/13:00072717

Organizační jednotka

Fakulta informatiky

ISBN

978-3-642-39175-0

ISSN

DOI

http://dx.doi.org/10.1007/978-3-642-39176-7_12

Klíčová slova anglicky

weigted CTL; model checking; Kripke structure; on-the-fly technique

Štítky

firank_B

Změněno: 29. 4. 2014 19:52, RNDr. Pavel Šmerk, Ph.D.

Anotace

V originále

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”.

Návaznosti

LG13010, projekt VaV

Název: Zastoupení ČR v European Research Consortium for Informatics and Mathematics (Akronym: ERCIM-CZ)

Investor: Ministerstvo školství, mládeže a tělovýchovy ČR, Zastoupení ČR v European Research Consortium for Informatics and Mathematics

Citovat

JENSEN, Jonas F., Kim G. LARSEN, Jiří SRBA a Lars K. OESTERGAARD. Local Model Checking of Weighted CTL with Upper-Bound Constraints. In Ezio Bartocci and C. R. Ramakrishnan. Proceedings of International SPIN Symposium on Model Checking of Software (SPIN'13). Netherlands: Springer, 2013, s. 178-195. ISBN 978-3-642-39175-0. Dostupné z: https://dx.doi.org/10.1007/978-3-642-39176-7_12.

@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 a 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, s.~178-195. ISBN~978-3-642-39175-0. Dostupné z: https://dx.doi.org/10.1007/978-3-642-39176-7\_{}12.

Podrobný výpis o publikaci