Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4950612 | Information and Computation | 2017 | 35 Pages |
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 characterization of the (much more involved) latter problem. A case study elucidates concepts and techniques.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Ilya Tkachev, Alexandru Mereacre, Joost-Pieter Katoen, Alessandro Abate,