Detailed Information on Publication Record
2017
Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games
SVOREŇOVÁ, Mária, Jan KŘETÍNSKÝ, Martin CHMELÍK, Krishnendu CHATTERJEE, Ivana ČERNÁ et. al.Basic information
Original name
Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games
Authors
SVOREŇOVÁ, Mária (703 Slovakia, belonging to the institution), Jan KŘETÍNSKÝ (203 Czech Republic, guarantor, belonging to the institution), Martin CHMELÍK (203 Czech Republic), Krishnendu CHATTERJEE (356 India), Ivana ČERNÁ (203 Czech Republic, belonging to the institution) and Calin BELTA (642 Romania)
Edition
Nonlinear Analysis: Hybrid Systems, Elsevier, 2017, 1751-570X
Other information
Language
English
Type of outcome
Článek v odborném periodiku
Field of Study
10201 Computer sciences, information science, bioinformatics
Country of publisher
Netherlands
Confidentiality degree
není předmětem státního či obchodního tajemství
Impact factor
Impact factor: 4.010
RIV identification code
RIV/00216224:14330/17:00094586
Organization unit
Faculty of Informatics
UT WoS
000390637000014
Keywords in English
probabilistic systems; verification; games; temporal logic
Tags
Tags
International impact, Reviewed
Změněno: 27/4/2018 10:33, RNDr. Pavel Šmerk, Ph.D.
Abstract
V originále
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.
Links
GA15-17564S, research and development project |
| ||
MUNI/A/0897/2016, interní kód MU |
|