The formal verification and controller synthesis for Markov decision processes that evolve over uncountable state spaces are computationally hard and thus generally rely on the use of approximations. In this work, we consider the correct-by-design control of general Markov decision processes (gMDPs) with respect to temporal logic properties by leveraging approximate probabilistic relations between the original model and its abstraction. We newly work with a robust satisfaction for the construction and verification of control strategies, which allows for both deviations in the outputs of the gMDPs and in the probabilistic transitions. The computation is done over the reduced or abstracted models, such that when a property is robustly satisfied on the abstract model, it is also satisfied on the original model with respect to a refined control strategy.
|Number of pages||23|
|Journal||arXiv.org, e-Print Archive, Physics|
|Publication status||Published - 20 Dec 2017|
Bibliographical note22 pages, 3 figures, submitted to the 24th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), 2018
- 93E03, 93E20, 68W25