Equivalence of Games with Probabilistic Uncertainty and Partial-Observation Games. - Krishnendu Chatterjee; Martin Chmelik; Rupak Majumdar (ATVA, 2012)

Controllable-Choice Message Sequence Graphs. - Martin Chmelik; Vojtech Rehák (MEMICS, 2012)

What is Decidable about Partially Observable Markov Decision Processes with omega-Regular Objectives. - Krishnendu Chatterjee; Martin Chmelik; Mathieu Tracol (CSL, 2013)

Verification of Markov Decision Processes Using Learning Algorithms. - Tomás Brázdil; Krishnendu Chatterjee; Martin Chmelik; Vojtech Forejt; Jan Kretínský; Marta Z. Kwiatkowska; David Parker 001; Mateusz Ujma (ATVA, 2014)

CEGAR for Qualitative Analysis of Probabilistic Systems. - Krishnendu Chatterjee; Martin Chmelik; Przemyslaw Daca (CAV, 2014)

Interface simulation distances. - Pavol Cerný; Martin Chmelik; Thomas A. Henzinger; Arjun Radhakrishna (Theor. Comput. Sci., 2014)

Counterexample Explanation by Learning Small Strategies in Markov Decision Processes. - Tomás Brázdil; Krishnendu Chatterjee; Martin Chmelik; Andreas Fellner; Jan Kretínský (CAV (1), 2015)

Temporal logic motion planning using POMDPs with parity objectives: case study paper. - María Svorenová; Martin Chmelik; Kevin Leahy 001; Hasan Ferit Eniser; Krishnendu Chatterjee; Ivana Cerná; Calin Belta (HSCC, 2015)

Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games. - María Svorenová; Jan Kretínský; Martin Chmelik; Krishnendu Chatterjee; Ivana Cerná; Calin Belta (HSCC, 2015)

Qualitative analysis of POMDPs with temporal logic specifications for robotics applications. - Krishnendu Chatterjee; Martin Chmelik; Raghav Gupta; Ayush Kanodia (ICRA, 2015)

POMDPs under probabilistic semantics. - Krishnendu Chatterjee; Martin Chmelik (Artif. Intell., 2015)

CEGAR for compositional analysis of qualitative properties in Markov decision processes. - Krishnendu Chatterjee; Martin Chmelik; Przemyslaw Daca (Formal Methods Syst. Des., 2015)

A Symbolic SAT-Based Algorithm for Almost-Sure Reachability with Small Strategies in POMDPs. - Krishnendu Chatterjee; Martin Chmelik; Jessica Davies 001 (AAAI, 2016)

Indefinite-Horizon Reachability in Goal-DEC-POMDPs. - Krishnendu Chatterjee; Martin Chmelik (ICAPS, 2016)

Stochastic Shortest Path with Energy Constraints in POMDPs: (Extended Abstract). - Tomás Brázdil; Krishnendu Chatterjee; Martin Chmelik; Anchit Gupta; Petr Novotný 001 (AAMAS, 2016)

Scheduling Real-Time Communication in IEEE 802.1Qbv Time Sensitive Networks. - Silviu S. Craciunas; Ramon Serna Oliver; Martin Chmelík; Wilfried Steiner (RTNS, 2016)

Optimal cost almost-sure reachability in POMDPs. - Krishnendu Chatterjee; Martin Chmelik; Raghav Gupta; Ayush Kanodia (Artif. Intell., 2016)

Stochastic Shortest Path with Energy Constraints in POMDPs. - Tomás Brázdil; Krishnendu Chatterjee; Martin Chmelik; Anchit Gupta; Petr Novotný 001 (CoRR, 2016)

What is decidable about partially observable Markov decision processes with ω-regular objectives. - Krishnendu Chatterjee; Martin Chmelik; Mathieu Tracol (J. Comput. Syst. Sci., 2016)

Sensor Synthesis for POMDPs with Reachability Objectives. - Krishnendu Chatterjee; Martin Chmelik; Ufuk Topcu (ICAPS, 2018)

Multiple-Environment Markov Decision Processes: Efficient Analysis and Applications. - Krishnendu Chatterjee; Martin Chmelík; Deep Karkhanis; Petr Novotný 001; Amélie Royer (ICAPS, 2020)

Learning Algorithms for Verification of Markov Decision Processes. - Tomás Brázdil; Krishnendu Chatterjee; Martin Chmelik; Vojtech Forejt; Jan Kretínský; Marta Kwiatkowska; Tobias Meggendorfer; David Parker 001; Mateusz Ujma (TheoretiCS, 2025)