Symbolic Algorithms for Qualitative Analysis of Markov Decision Processes with "Buchi Objectives"
We consider Markov decision processes (MDPs) with ?-regular specifications given as parity objectives. We consider the problem of computing the set of almost-sure winning states from where the objective can be ensured with probability 1. The algorithms for the computation of the almost-sure winning set for parity objectives iteratively use the solutions for the almost-sure winning set for B
University of Vienna
Währinger Straße 29