Model Checking and Synthesis for Branching Multi-Weighted
Logics

J 2019

Model Checking and Synthesis for Branching Multi-Weighted Logics

JENSEN, Lasse S.; Isabella KAUFMANN; Kim G. LARSEN; Soeren M. NIELSEN; Jiří SRBA et al.

Základní údaje

Originální název

Model Checking and Synthesis for Branching Multi-Weighted Logics

Autoři

JENSEN, Lasse S.; Isabella KAUFMANN; Kim G. LARSEN; Soeren M. NIELSEN a Jiří SRBA

Vydání

Journal of Logical and Algebraic Methods in Programming, 2019, 2352-2208

Další údaje

Jazyk

angličtina

Typ výsledku

Článek v odborném periodiku

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í

Odkazy

URL

Impakt faktor

Impact factor: 0.685

Označené pro přenos do RIV

Ano

Kód RIV

RIV/00216224:14330/19:00113645

Organizační jednotka

Fakulta informatiky

Klíčová slova anglicky

model checking; logic; synthesis

Změněno: 6. 5. 2020 17:13, RNDr. Pavel Šmerk, Ph.D.

Anotace

V originále

We investigate the open synthesis problem in a quantitative game theoretic setting where the system model is annotated with multiple nonnegative weights representing quantitative resources such as energy, discrete time or cost. We consider system specifications expressed in the branching time logic CTL extended with bounds on resources. As our first contribution, we show that the model checking problem for the full logic is undecidable with already three weights. By restricting the bounds to constant upper or lower-bounds on the individual weights, we demonstrate that the problem becomes decidable and that the model checking problem is PSPACE-complete. As a second contribution, we show that by imposing upper-bounds on the temporal operators and assuming that the cost converges over infinite runs, the synthesis problem is also decidable. Finally, we provide an on-the-fly algorithm for the synthesis problem on an unrestricted model for a reachability fragment of the logic and we prove EXPTIME-completeness of the synthesis problem.

Citovat

JENSEN, Lasse S.; Isabella KAUFMANN; Kim G. LARSEN; Soeren M. NIELSEN a Jiří SRBA. Model Checking and Synthesis for Branching Multi-Weighted Logics. Journal of Logical and Algebraic Methods in Programming. 2019, roč. 105, June 2019, s. 28-46. ISSN 2352-2208. Dostupné z: https://doi.org/10.1016/j.jlamp.2019.02.001.

@article{1646351,
   author = {Jensen, Lasse S. and Kaufmann, Isabella and Larsen, Kim G. and Nielsen, Soeren M. and Srba, Jiří},
   article_number = {June 2019},
   doi = {https://doi.org/10.1016/j.jlamp.2019.02.001},
   keywords = {model checking; logic; synthesis},
   language = {eng},
   issn = {2352-2208},
   journal = {Journal of Logical and Algebraic Methods in Programming},
   title = {Model Checking and Synthesis for Branching Multi-Weighted Logics},
   url = {https://doi.org/10.1016/j.jlamp.2019.02.001},
   volume = {105},
   year = {2019}
}

TY  - JOUR
ID  - 1646351
AU  - Jensen, Lasse S. - Kaufmann, Isabella - Larsen, Kim G. - Nielsen, Soeren M. - Srba, Jiří
PY  - 2019
TI  - Model Checking and Synthesis for Branching Multi-Weighted Logics
JF  - Journal of Logical and Algebraic Methods in Programming
VL  - 105
IS  - June 2019
SP  - 28-46
EP  - 28-46
SN  - 23522208
KW  - model checking
KW  - logic
KW  - synthesis
UR  - https://doi.org/10.1016/j.jlamp.2019.02.001
L2  - https://doi.org/10.1016/j.jlamp.2019.02.001
N2  - We investigate the open synthesis problem in a quantitative game theoretic setting where the system model is annotated with multiple nonnegative weights representing quantitative resources such as energy, discrete time or cost. We consider system specifications expressed in the branching time logic CTL extended with bounds on resources. As our first contribution, we show that the model checking problem for the full logic is undecidable with already three weights. By restricting the bounds to constant upper or lower-bounds on the individual weights, we demonstrate that the problem becomes decidable and that the model checking problem is PSPACE-complete. As a second contribution, we show that by imposing upper-bounds on the temporal operators and assuming that the cost converges over infinite runs, the synthesis problem is also decidable. Finally, we provide an on-the-fly algorithm for the synthesis problem on an unrestricted model for a reachability fragment of the logic and we prove EXPTIME-completeness of the synthesis problem.
ER  -

JENSEN, Lasse S.; Isabella KAUFMANN; Kim G. LARSEN; Soeren M. NIELSEN a Jiří SRBA. Model Checking and Synthesis for Branching Multi-Weighted Logics. \textit{Journal of Logical and Algebraic Methods in Programming}. 2019, roč.~105, June 2019, s.~28-46. ISSN~2352-2208. Dostupné z: https://doi.org/10.1016/j.jlamp.2019.02.001.

Přehled o publikaci