1. Markov Decision Processes with Sure Parity and Multiple Reachability Objectives
- Author
-
Berthon, Raphaël, Katoen, Joost-Pieter, and Winkler, Tobias
- Subjects
Computer Science - Computer Science and Game Theory - Abstract
This paper considers the problem of finding strategies that satisfy a mixture of sure and threshold objectives in Markov decision processes. We focus on a single $\omega$-regular objective expressed as parity that must be surely met while satisfying $n$ reachability objectives towards sink states with some probability thresholds too. We consider three variants of the problem: (a) strict and (b) non-strict thresholds on all reachability objectives, and (c) maximizing the thresholds with respect to a lexicographic order. We show that (a) and (c) can be reduced to solving parity games, and (b) can be solved in $\sf{EXPTIME}$. Strategy complexities as well as algorithms are provided for all cases., Comment: Paper accepted to RP 2024 - Full version
- Published
- 2024