3 citations · 9 across the 10 of their papers we have counts for
6 papers · 1 filter
Counterexample Explanation by Learning Small Strategies in Markov Decision Processes
Tomáš Brázdil, Krishnendu Chatterjee, Martin Chmelík +2
While for deterministic systems, a counterexample to a property can simply be an error trace, counterexamples in probabilistic systems are necessarily more complex. For instance, a…
Qualitative Analysis of POMDPs with Temporal Logic Specifications for Robotics Applications
Krishnendu Chatterjee, Martin Chmelík, Raghav Gupta +1
We consider partially observable Markov decision processes (POMDPs), that are a standard framework for robotics applications to model uncertainties present in the real world, with…
CEGAR for Qualitative Analysis of Probabilistic Systems
Krishnendu Chatterjee, Martin Chmelik, Przemyslaw Daca
We consider Markov decision processes (MDPs) which are a standard model for probabilistic systems. We focus on qualitative properties for MDPs that can express that desired behavio…
Verification of Markov Decision Processes using Learning Algorithms
Tomáš Brázdil, Krishnendu Chatterjee, Martin Chmelík +5
We present a general framework for applying machine-learning algorithms to the verification of Markov decision processes (MDPs). The primary goal of these techniques is to improve…
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…
Controllable-choice Message Sequence Graphs
Martin Chmelík, Vojtěch Řehák
We focus on the realizability problem of Message Sequence Graphs (MSG), i.e. the problem whether a given MSG specification is correctly distributable among parallel components comm…