Model Checking and Synthesis for Branching Multi-Weighted Logics

Result code in 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>

Result on the web

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

Result language

angličtina

Original language name

Model Checking and Synthesis for Branching Multi-Weighted Logics

Original language description

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.

Czech name

—

Czech description

—

Type

J_imp - Article in a specialist periodical, which is included in the Web of Science database

CEP classification

—

OECD FORD branch

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

Project

—

Continuities

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year

2019

Confidentiality

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

Name of the periodical

Journal of Logical and Algebraic Methods in Programming

ISSN

2352-2208

e-ISSN

2352-2216

Volume of the periodical

105

Issue of the periodical within the volume

June 2019

Country of publishing house

NL - THE KINGDOM OF THE NETHERLANDS

Number of pages

19

Pages from-to

28-46

UT code for WoS article

000467670900002

EID of the result in the Scopus database

2-s2.0-85079061383