| SVOREŇOVÁ, Mária, Jan KŘETÍNSKÝ, Martin CHMELÍK, Krishnendu CHATTERJEE, Ivana ČERNÁ and Calin BELTA. Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games. Nonlinear Analysis: Hybrid Systems. Elsevier, 2017, vol. 23, February 2017, p. 230-253. ISSN 1751-570X. Available from: https://dx.doi.org/10.1016/j.nahs.2016.04.006. |
Other formats:
BibTeX
LaTeX
RIS
@article{1365664,
author = {Svoreňová, Mária and Křetínský, Jan and Chmelík, Martin and Chatterjee, Krishnendu and Černá, Ivana and Belta, Calin},
article_number = {February 2017},
doi = {http://dx.doi.org/10.1016/j.nahs.2016.04.006},
keywords = {probabilistic systems; verification; games; temporal logic},
language = {eng},
issn = {1751-570X},
journal = {Nonlinear Analysis: Hybrid Systems},
title = {Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games},
volume = {23},
year = {2017}
}
TY - JOUR
ID - 1365664
AU - Svoreňová, Mária - Křetínský, Jan - Chmelík, Martin - Chatterjee, Krishnendu - Černá, Ivana - Belta, Calin
PY - 2017
TI - Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games
JF - Nonlinear Analysis: Hybrid Systems
VL - 23
IS - February 2017
SP - 230-253
EP - 230-253
PB - Elsevier
SN - 1751570X
KW - probabilistic systems
KW - verification
KW - games
KW - temporal logic
N2 - 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.
ER -
SVOREŇOVÁ, Mária, Jan KŘETÍNSKÝ, Martin CHMELÍK, Krishnendu CHATTERJEE, Ivana ČERNÁ and Calin BELTA. Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games. \textit{Nonlinear Analysis: Hybrid Systems}. Elsevier, 2017, vol.~23, February 2017, p.~230-253. ISSN~1751-570X. Available from: https://dx.doi.org/10.1016/j.nahs.2016.04.006.
|
