19 citations · 19 across the 3 of their papers we have counts for
4 papers
What is Decidable about Partially Observable Markov Decision Processes with ω-Regular Objectives
Krishnendu Chatterjee, Martin Chmelik, Mathieu Tracol
We consider partially observable Markov decision processes (POMDPs) with ω-regular conditions specified as parity objectives. The class of ω-regular languages extends regular langu…
Decidable Problems for Probabilistic Automata on Infinite Words
Krishnendu Chatterjee, Mathieu Tracol
We consider probabilistic automata on infinite words with acceptance defined by parity conditions. We consider three qualitative decision problems: (i) the positive decision proble…
Computing Distances between Probabilistic Automata
Mathieu Tracol, Josée Desharnais, Abir Zhioua
We present relaxed notions of simulation and bisimulation on Probabilistic Automata (PA), that allow some error epsilon. When epsilon is zero we retrieve the usual notions of bisim…
The Decidability Frontier for Probabilistic Automata on Infinite Words
Krishnendu Chatterjee, Thomas A. Henzinger, Mathieu Tracol
We consider probabilistic automata on infinite words with acceptance defined by safety, reachability, Büchi, coBüchi, and limit-average conditions. We consider quantitative and qua…