Complexity of deciding Tarski algebra
Journal of Symbolic Computation
The complexity of probabilistic verification
Journal of the ACM (JACM)
The complexity of mean payoff games on graphs
Theoretical Computer Science
Probabilistic simulations for probabilistic processes
Nordic Journal of Computing
Infinite Games and Verification (Extended Abstract of a Tutorial)
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
How to Specify and Verify the Long-Run Average Behavior of Probabilistic Systems
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
On the Controller Synthesis for Finite-State Markov Decision Processes
Fundamenta Informaticae
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Energy and mean-payoff parity markov decision processes
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
On the Controller Synthesis for Finite-State Markov Decision Processes
Fundamenta Informaticae
Strategy synthesis for markov decision processes and branching-time logics
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Hi-index | 0.00 |
We study the problem of effective controller synthesis for finite-state Markov decision processes (MDPs) and the class of properties definable in the logic PCTL extended with long-run average propositions. We show that the existence of such a controller is decidable, and we give an algorithm which computes the controller if it exists. We also address the issue of “controller robustness”, i.e., the problem whether there is a controller which still guarantees the satisfaction of a given property when the probabilities in the considered MDP slightly deviate from their original values. From a practical point of view, this is an important aspect since the probabilities are often determined empirically and hence they are inherently imprecise. We show that the existence of robust controllers is also decidable, and that such controllers are effectively computable if they exist.