Other formats:
BibTeX
LaTeX
RIS
@inproceedings{1206052,
author = {Svoreňová, Mária and Křetínský, Jan and Chmelík, Martin and Chatterjee, Krishnendu and Černá, Ivana and Belta, Calin},
address = {Seattle, Washington, USA},
booktitle = {Proceedings of ACM international conference on Hybrid Systems: Computation and Control},
doi = {http://dx.doi.org/10.1145/2728606.2728608},
keywords = {control; linear temporal logic (LTL); linear stochastic system; games},
howpublished = {elektronická verze "online"},
language = {eng},
location = {Seattle, Washington, USA},
isbn = {978-1-4503-3433-4},
pages = {259-268},
publisher = {Association for Computing Machinery (ACM)},
title = {Temporal Logic Control for Stochastic Linear Systems using Abstraction Refinement of Probabilistic Games},
year = {2015}
}
TY - JOUR
ID - 1206052
AU - Svoreňová, Mária - Křetínský, Jan - Chmelík, Martin - Chatterjee, Krishnendu - Černá, Ivana - Belta, Calin
PY - 2015
TI - Temporal Logic Control for Stochastic Linear Systems using Abstraction Refinement of Probabilistic Games
PB - Association for Computing Machinery (ACM)
CY - Seattle, Washington, USA
SN - 9781450334334
KW - control
KW - linear temporal logic (LTL)
KW - linear stochastic system
KW - games
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 satisfying initial states. Moreover, for any (partial) solution our algorithm synthesizes witness control strategies to ensure almost-sure satisfaction of the temporal logic specification. We demonstrate our approach 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. In \textit{Proceedings of ACM international conference on Hybrid Systems: Computation and Control}. Seattle, Washington, USA: Association for Computing Machinery (ACM). p.~259-268. ISBN~978-1-4503-3433-4. doi:10.1145/2728606.2728608. 2015.
|
