Martin Chmelik

According to our database, Martin Chmelik authored at least 22 papers between 2012 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

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, Mateusz Ujma

CoRR, 2024

2020

Multiple-Environment Markov Decision Processes: Efficient Analysis and Applications.

Krishnendu Chatterjee, Martin Chmelík, Deep Karkhanis, Petr Novotný, Amélie Royer

Proceedings of the Thirtieth International Conference on Automated Planning and Scheduling, 2020

2018

Sensor Synthesis for POMDPs with Reachability Objectives.

Krishnendu Chatterjee, Martin Chmelik, Ufuk Topcu

Proceedings of the Twenty-Eighth International Conference on Automated Planning and Scheduling, 2018

2016

What is decidable about partially observable Markov decision processes with ω-regular objectives.

Krishnendu Chatterjee, Martin Chmelik, Mathieu Tracol

J. Comput. Syst. Sci., 2016

Stochastic Shortest Path with Energy Constraints in POMDPs.

Tomás Brázdil, Krishnendu Chatterjee, Martin Chmelik, Anchit Gupta, Petr Novotný

CoRR, 2016

Optimal cost almost-sure reachability in POMDPs.

Krishnendu Chatterjee, Martin Chmelik, Raghav Gupta, Ayush Kanodia

Artif. Intell., 2016

Scheduling Real-Time Communication in IEEE 802.1Qbv Time Sensitive Networks.

Silviu S. Craciunas, Ramon Serna Oliver, Martin Chmelík, Wilfried Steiner

Proceedings of the 24th International Conference on Real-Time Networks and Systems, 2016

Stochastic Shortest Path with Energy Constraints in POMDPs: (Extended Abstract).

Tomás Brázdil, Krishnendu Chatterjee, Martin Chmelik, Anchit Gupta, Petr Novotný

Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, 2016

Indefinite-Horizon Reachability in Goal-DEC-POMDPs.

Krishnendu Chatterjee, Martin Chmelik

Proceedings of the Twenty-Sixth International Conference on Automated Planning and Scheduling, 2016

A Symbolic SAT-Based Algorithm for Almost-Sure Reachability with Small Strategies in POMDPs.

Krishnendu Chatterjee, Martin Chmelik, Jessica Davies

Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2015

CEGAR for compositional analysis of qualitative properties in Markov decision processes.

Krishnendu Chatterjee, Martin Chmelik, Przemyslaw Daca

Formal Methods Syst. Des., 2015

POMDPs under probabilistic semantics.

Krishnendu Chatterjee, Martin Chmelik

Artif. Intell., 2015

Qualitative analysis of POMDPs with temporal logic specifications for robotics applications.

Krishnendu Chatterjee, Martin Chmelik, Raghav Gupta, Ayush Kanodia

Proceedings of the IEEE International Conference on Robotics and Automation, 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

Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control, 2015

Temporal logic motion planning using POMDPs with parity objectives: case study paper.

María Svorenová, Martin Chmelik, Kevin Leahy, Hasan Ferit Eniser, Krishnendu Chatterjee, Ivana Cerná, Calin Belta

Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control, 2015

Counterexample Explanation by Learning Small Strategies in Markov Decision Processes.

Tomás Brázdil, Krishnendu Chatterjee, Martin Chmelik, Andreas Fellner, Jan Kretínský

Proceedings of the Computer Aided Verification - 27th International Conference, 2015

2014

Interface simulation distances.

Pavol Cerný, Martin Chmelik, Thomas A. Henzinger, Arjun Radhakrishna

Theor. Comput. Sci., 2014

CEGAR for Qualitative Analysis of Probabilistic Systems.

Krishnendu Chatterjee, Martin Chmelik, Przemyslaw Daca

Proceedings of the Computer Aided Verification - 26th International Conference, 2014

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, Mateusz Ujma

Proceedings of the Automated Technology for Verification and Analysis, 2014

2013

What is Decidable about Partially Observable Markov Decision Processes with omega-Regular Objectives.

Krishnendu Chatterjee, Martin Chmelik, Mathieu Tracol

Proceedings of the Computer Science Logic 2013 (CSL 2013), 2013

2012

Controllable-Choice Message Sequence Graphs.

Martin Chmelik, Vojtech Rehák

Proceedings of the Mathematical and Engineering Methods in Computer Science, 2012

Equivalence of Games with Probabilistic Uncertainty and Partial-Observation Games.

Krishnendu Chatterjee, Martin Chmelik, Rupak Majumdar

Proceedings of the Automated Technology for Verification and Analysis, 2012