Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F17%3A00094586" target="_blank" >RIV/00216224:14330/17:00094586 - isvavai.cz</a>

Výsledek na webu

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

DOI - Digital Object Identifier

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

Jazyk výsledku

angličtina

Název v původním jazyce

Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games

Popis výsledku v původním jazyce

We consider the problem of computing the set of initial states of a dynamical system such that there exists a control strategy to ensure that the trajectories satisfy a temporal logic specification with probability 1 (almost-surely). We focus on discrete-time, stochastic linear dynamics and specifications given as formulas of the Generalized Reactivity(1) fragment of Linear Temporal Logic over linear predicates in the states of the system. We propose a solution based on iterative abstraction-refinement, and turn-based 2-player probabilistic games. While the theoretical guarantee of our algorithm after any finite number of iterations is only a partial solution, we show that if our algorithm terminates, then the result is the set of all satisfying initial states. Moreover, for any (partial) solution our algorithm synthesizes witness control strategies to ensure almost-sure satisfaction of the temporal logic specification. While the proposed algorithm guarantees progress and soundness in every iteration, it is computationally demanding. We offer an alternative, more efficient solution for the reachability properties that decomposes the problem into a series of smaller problems of the same type. All algorithms are demonstrated on an illustrative case study.

Název v anglickém jazyce

Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games

Popis výsledku anglicky

We consider the problem of computing the set of initial states of a dynamical system such that there exists a control strategy to ensure that the trajectories satisfy a temporal logic specification with probability 1 (almost-surely). We focus on discrete-time, stochastic linear dynamics and specifications given as formulas of the Generalized Reactivity(1) fragment of Linear Temporal Logic over linear predicates in the states of the system. We propose a solution based on iterative abstraction-refinement, and turn-based 2-player probabilistic games. While the theoretical guarantee of our algorithm after any finite number of iterations is only a partial solution, we show that if our algorithm terminates, then the result is the set of all satisfying initial states. Moreover, for any (partial) solution our algorithm synthesizes witness control strategies to ensure almost-sure satisfaction of the temporal logic specification. While the proposed algorithm guarantees progress and soundness in every iteration, it is computationally demanding. We offer an alternative, more efficient solution for the reachability properties that decomposes the problem into a series of smaller problems of the same type. All algorithms are demonstrated on an illustrative case study.

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

<a href="/cs/project/GA15-17564S" target="_blank" >GA15-17564S: Teorie her jako prostředek pro formální analýzu a verifikaci počítačových systémů</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2017

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

Nonlinear Analysis: Hybrid Systems

ISSN

1751-570X

e-ISSN

—

Svazek periodika

23

Číslo periodika v rámci svazku

February 2017

Stát vydavatele periodika

NL - Nizozemsko

Počet stran výsledku

24

Strana od-do

230-253

Kód UT WoS článku

000390637000014

EID výsledku v databázi Scopus

2-s2.0-84973879718