Model Checking and Synthesis for Branching Multi-Weighted Logics

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F19%3A00113645" target="_blank" >RIV/00216224:14330/19:00113645 - isvavai.cz</a>

Výsledek na webu

<a href="https://doi.org/10.1016/j.jlamp.2019.02.001" target="_blank" >https://doi.org/10.1016/j.jlamp.2019.02.001</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1016/j.jlamp.2019.02.001" target="_blank" >10.1016/j.jlamp.2019.02.001</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Model Checking and Synthesis for Branching Multi-Weighted Logics

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

Model Checking and Synthesis for Branching Multi-Weighted Logics

Popis výsledku anglicky

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.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

—

Návaznosti

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2019

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

Journal of Logical and Algebraic Methods in Programming

ISSN

2352-2208

e-ISSN

2352-2216

Svazek periodika

105

Číslo periodika v rámci svazku

June 2019

Stát vydavatele periodika

NL - Nizozemsko

Počet stran výsledku

19

Strana od-do

28-46

Kód UT WoS článku

000467670900002

EID výsledku v databázi Scopus

2-s2.0-85079061383