Multiple-environment Markov decision processes: Efficient analysis and applications
K. Chatterjee, M. Chmelik, D. Karkhanis, P. Novotný, A. Royer, in:, Proceedings of the 30th International Conference on Automated Planning and Scheduling, Association for the Advancement of Artificial Intelligence, 2020, pp. 48–56.
LibreCat: https://research-explorer.ista.ac.at/record/8193

Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games
M. Svoreová, J. Kretinsky, M. Chmelik, K. Chatterjee, I. Cbrná, C. Belta, Nonlinear Analysis: Hybrid Systems 23 (2017) 230–253.
LibreCat: https://research-explorer.ista.ac.at/record/1407
DOI: 10.1016/j.nahs.2016.04.006
WoS: 000390637000014
arXiv: 1410.5387

Indefinite-horizon reachability in Goal-DEC-POMDPs
K. Chatterjee, M. Chmelik, in:, Proceedings of the Twenty-Sixth International Conference on International Conference on Automated Planning and Scheduling, AAAI Press, 2016, pp. 88–96.
LibreCat: https://research-explorer.ista.ac.at/record/1324

Stochastic shortest path with energy constraints in POMDPs
T. Brázdil, K. Chatterjee, M. Chmelik, A. Gupta, P. Novotný, in:, Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems, ACM, 2016, pp. 1465–1466.
LibreCat: https://research-explorer.ista.ac.at/record/1327

Efficient strategies for calculating blockwise likelihoods under the coalescent
K. Lohse, M. Chmelik, S. Martin, N.H. Barton, Genetics 202 (2016) 775–786.
LibreCat: https://research-explorer.ista.ac.at/record/1518
DOI: 10.1534/genetics.115.183814
PMID: 26715666

What is decidable about partially observable Markov decision processes with <9-regular objectives
K. Chatterjee, M. Chmelik, M. Tracol, Journal of Computer and System Sciences 82 (2016) 878–911.
LibreCat: https://research-explorer.ista.ac.at/record/1477
DOI: 10.1016/j.jcss.2016.02.009
arXiv: 1309.2802

Optimal cost almost-sure reachability in POMDPs
K. Chatterjee, M. Chmelik, R. Gupta, A. Kanodia, Artificial Intelligence 234 (2016) 26–48.
LibreCat: https://research-explorer.ista.ac.at/record/1529
DOI: 10.1016/j.artint.2016.01.007
arXiv: 1411.3880

A symbolic SAT based algorithm for almost sure reachability with small strategies in pomdps
K. Chatterjee, M. Chmelik, J. Davies, in:, Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, AAAI Press, 2016, pp. 3225–3232.
LibreCat: https://research-explorer.ista.ac.at/record/1166

Algorithms for partially observable markov decision processes
M. Chmelik, Algorithms for Partially Observable Markov Decision Processes, Institute of Science and Technology Austria, 2016.
LibreCat: https://research-explorer.ista.ac.at/record/1397

Temporal logic motion planning using POMDPs with parity objectives: Case study paper
M. Svoreová, M. Chmelik, K. Leahy, H. Eniser, K. Chatterjee, I. Cbrná, C. Belta, in:, Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control, ACM, 2015, pp. 233–238.
LibreCat: https://research-explorer.ista.ac.at/record/1691
DOI: 10.1145/2728606.2728617

Optimal cost almost-sure reachability in POMDPs
K. Chatterjee, M. Chmelik, R. Gupta, A. Kanodia, in:, Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence , AAAI Press, 2015, pp. 3496–3502.
LibreCat: https://research-explorer.ista.ac.at/record/1820
arXiv: 1411.3880

POMDPs under probabilistic semantics
K. Chatterjee, M. Chmelik, Artificial Intelligence 221 (2015) 46–72.
LibreCat: https://research-explorer.ista.ac.at/record/1873
DOI: 10.1016/j.artint.2014.12.009
arXiv: 1408.2058

Qualitative analysis of POMDPs with temporal logic specifications for robotics applications
K. Chatterjee, M. Chmelik, R. Gupta, A. Kanodia, in:, IEEE, 2015, pp. 325–330.
LibreCat: https://research-explorer.ista.ac.at/record/1732
DOI: 10.1109/ICRA.2015.7139019
arXiv: 1409.3360

A symbolic SAT-based algorithm for almost-sure reachability with small strategies in POMDPs
K. Chatterjee, M. Chmelik, J. Davies, A Symbolic SAT-Based Algorithm for Almost-Sure Reachability with Small Strategies in POMDPs, IST Austria, 2015.
LibreCat: https://research-explorer.ista.ac.at/record/5443
DOI: 10.15479/AT:IST-2015-325-v2-1

CEGAR for compositional analysis of qualitative properties in Markov decision processes
K. Chatterjee, M. Chmelik, P. Daca, Formal Methods in System Design 47 (2015) 230–264.
LibreCat: https://research-explorer.ista.ac.at/record/1501
DOI: 10.1007/s10703-015-0235-2

Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games
M. Svoreová, J. Kretinsky, M. Chmelik, K. Chatterjee, I. Cbrná, C. Belta, in:, Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control, ACM, 2015, pp. 259–268.
LibreCat: https://research-explorer.ista.ac.at/record/1689
DOI: 10.1145/2728606.2728608

Counterexample explanation by learning small strategies in Markov decision processes
T. Brázdil, K. Chatterjee, M. Chmelik, A. Fellner, J. Kretinsky, in:, Springer, 2015, pp. 158–177.
LibreCat: https://research-explorer.ista.ac.at/record/1603
DOI: 10.1007/978-3-319-21690-4_10

Verification of markov decision processes using learning algorithms
T. Brázdil, K. Chatterjee, M. Chmelik, V. Forejt, J. Kretinsky, M. Kwiatkowska, D. Parker, M. Ujma, in:, F. Cassez, J.-F. Raskin (Eds.),  Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Society of Industrial and Applied Mathematics, 2014, pp. 98–114.
LibreCat: https://research-explorer.ista.ac.at/record/2027
DOI: 10.1007/978-3-319-11936-6_8

Interface simulation distances
P. Cerny, M. Chmelik, T.A. Henzinger, A. Radhakrishna, Theoretical Computer Science 560 (2014) 348–363.
LibreCat: https://research-explorer.ista.ac.at/record/1733
DOI: 10.1016/j.tcs.2014.08.019

CEGAR for qualitative analysis of probabilistic systems
K. Chatterjee, P. Daca, M. Chmelik, CEGAR for Qualitative Analysis of Probabilistic Systems, IST Austria, 2014.
LibreCat: https://research-explorer.ista.ac.at/record/5413
DOI: 10.15479/AT:IST-2014-153-v2-2

CEGAR for qualitative analysis of probabilistic systems
K. Chatterjee, P. Daca, M. Chmelik, CEGAR for Qualitative Analysis of Probabilistic Systems, IST Austria, 2014.
LibreCat: https://research-explorer.ista.ac.at/record/5414
DOI: 10.15479/AT:IST-2014-153-v3-1

CEGAR for qualitative analysis of probabilistic systems
K. Chatterjee, P. Daca, M. Chmelik, CEGAR for Qualitative Analysis of Probabilistic Systems, IST Austria, 2014.
LibreCat: https://research-explorer.ista.ac.at/record/5412
DOI: 10.15479/AT:IST-2014-153-v1-1

Qualitative analysis of POMDPs with temporal logic specifications for robotics applications
K. Chatterjee, M. Chmelik, R. Gupta, A. Kanodia, Qualitative Analysis of POMDPs with Temporal Logic Specifications for Robotics Applications, IST Austria, 2014.
LibreCat: https://research-explorer.ista.ac.at/record/5424
DOI: 10.15479/AT:IST-2014-305-v1-1

Qualitative analysis of POMDPs with temporal logic specifications for robotics applications
K. Chatterjee, M. Chmelik, R. Gupta, A. Kanodia, Qualitative Analysis of POMDPs with Temporal Logic Specifications for Robotics Applications, IST Austria, 2014.
LibreCat: https://research-explorer.ista.ac.at/record/5426
DOI: 10.15479/AT:IST-2014-305-v2-1

CEGAR for qualitative analysis of probabilistic systems
K. Chatterjee, M. Chmelik, P. Daca, in:, Springer, 2014, pp. 473–490.
LibreCat: https://research-explorer.ista.ac.at/record/2063
DOI: 10.1007/978-3-319-08867-9_31

Controllable-choice message sequence graphs
M. Chmelik, V. ehák, 7721 (2013) 118–130.
LibreCat: https://research-explorer.ista.ac.at/record/2886
DOI: 10.1007/978-3-642-36046-6_12

What is decidable about partially observable Markov decision processes with omega-regular objectives
K. Chatterjee, M. Chmelik, M. Tracol, 23 (2013) 165–180.
LibreCat: https://research-explorer.ista.ac.at/record/2295
DOI: 10.4230/LIPIcs.CSL.2013.165

What is decidable about partially observable Markov decision processes with <9-regular objectives
K. Chatterjee, M. Chmelik, M. Tracol, What Is Decidable about Partially Observable Markov Decision Processes with <9-Regular Objectives, IST Austria, 2013.
LibreCat: https://research-explorer.ista.ac.at/record/5400
DOI: 10.15479/AT:IST-2013-109-v1-1

Interface Simulation Distances
P. Cerny, M. Chmelik, T.A. Henzinger, A. Radhakrishna, in:, Electronic Proceedings in Theoretical Computer Science, EPTCS, 2012, pp. 29–42.
LibreCat: https://research-explorer.ista.ac.at/record/2916
DOI: 10.4204/EPTCS.96.3
arXiv: 1210.2450

Equivalence of games with probabilistic uncertainty and partial observation games
K. Chatterjee, M. Chmelik, R. Majumdar, in:, Springer, 2012, pp. 385–399.
LibreCat: https://research-explorer.ista.ac.at/record/2947
DOI: 10.1007/978-3-642-33386-6_30