Quantitative model-checking of controlled discrete-time Markov processes
Probability
2014-07-22 v1 Formal Languages and Automata Theory
Systems and Control
Optimization and Control
Abstract
This paper focuses on optimizing probabilities of events of interest defined over general controlled discrete-time Markov processes. It is shown that the optimization over a wide class of -regular properties can be reduced to the solution of one of two fundamental problems: reachability and repeated reachability. We provide a comprehensive study of the former problem and an initial characterisation of the (much more involved) latter problem. A case study elucidates concepts and techniques.
Cite
@article{arxiv.1407.5449,
title = {Quantitative model-checking of controlled discrete-time Markov processes},
author = {Ilya Tkachev and Alexandru Mereacre and Joost-Pieter Katoen and Alessandro Abate},
journal= {arXiv preprint arXiv:1407.5449},
year = {2014}
}