30 Publications

Mark all

[30]
2020 | Conference Paper | IST-REx-ID: 8193
Chatterjee K, Chmelik M, Karkhanis D, Novotný P, Royer A. 2020. Multiple-environment Markov decision processes: Efficient analysis and applications. Proceedings of the 30th International Conference on Automated Planning and Scheduling. ICAPS: International Conference on Automated Planning and Scheduling vol. 30. 48–56.
View | Files available
 
[29]
2017 | Journal Article | IST-REx-ID: 1407 | OA
Svoreňová M, Kretinsky J, Chmelik M, Chatterjee K, Cěrná I, Belta C. 2017. Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games. Nonlinear Analysis: Hybrid Systems. 23(2), 230–253.
View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[28]
2016 | Conference Paper | IST-REx-ID: 1324
Chatterjee K, Chmelik M. 2016. Indefinite-horizon reachability in Goal-DEC-POMDPs. Proceedings of the Twenty-Sixth International Conference on International Conference on Automated Planning and Scheduling. ICAPS: International Conference on Automated Planning and Scheduling vol. 2016–January. 88–96.
View | Download None (ext.)
 
[27]
2016 | Conference Paper | IST-REx-ID: 1327 | OA
Brázdil T, Chatterjee K, Chmelik M, Gupta A, Novotny P. 2016. Stochastic shortest path with energy constraints in POMDPs. Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems. AAMAS: Autonomous Agents & Multiagent Systems 1465–1466.
View | Download Preprint (ext.)
 
[26]
2016 | Thesis | IST-REx-ID: 1397
Chmelik M. 2016. Algorithms for partially observable markov decision processes, IST Austria, 232p.
View
 
[25]
2016 | Journal Article | IST-REx-ID: 1477 | OA
Chatterjee K, Chmelik M, Tracol M. 2016. What is decidable about partially observable Markov decision processes with ω-regular objectives. Journal of Computer and System Sciences. 82(5), 878–911.
View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[24]
2016 | Journal Article | IST-REx-ID: 1518 | OA
Lohse K, Chmelik M, Martin S, Barton NH. 2016. Efficient strategies for calculating blockwise likelihoods under the coalescent. Genetics. 202(2), 775–786.
View | Files available | DOI
 
[23]
2016 | Journal Article | IST-REx-ID: 1529 | OA
Chatterjee K, Chmelik M, Gupta R, Kanodia A. 2016. Optimal cost almost-sure reachability in POMDPs. Artificial Intelligence. 234, 26–48.
View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[22]
2016 | Conference Paper | IST-REx-ID: 1166
Chatterjee K, Chmelik M, Davies J. 2016. A symbolic SAT based algorithm for almost sure reachability with small strategies in pomdps. Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence. AAAI: Conference on Artificial Intelligence vol. 2016. 3225–3232.
View | Files available
 
[21]
2015 | Technical Report | IST-REx-ID: 5443 | OA
Chatterjee K, Chmelik M, Davies J. 2015. A symbolic SAT-based algorithm for almost-sure reachability with small strategies in POMDPs, IST Austria, 23p.
View | Files available | DOI
 
[20]
2015 | Conference Paper | IST-REx-ID: 1603 | OA
Brázdil T, Chatterjee K, Chmelik M, Fellner A, Kretinsky J. 2015. Counterexample explanation by learning small strategies in Markov decision processes. CAV: Computer Aided Verification, LNCS, vol. 9206. 158–177.
View | Files available | DOI | Download Preprint (ext.)
 
[19]
2015 | Conference Paper | IST-REx-ID: 1689 | OA
Svoreňová M, Kretinsky J, Chmelik M, Chatterjee K, Cěrná I, Belta C. 2015. Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games. Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control. HSCC: Hybrid Systems - Computation and Control 259–268.
View | Files available | DOI | Download Preprint (ext.)
 
[18]
2015 | Conference Paper | IST-REx-ID: 1691
Svoreňová M, Chmelik M, Leahy K, Eniser H, Chatterjee K, Cěrná I, Belta C. 2015. Temporal logic motion planning using POMDPs with parity objectives: Case study paper. Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control. HSCC: Hybrid Systems - Computation and Control 233–238.
View | DOI
 
[17]
2015 | Conference Paper | IST-REx-ID: 1732 | OA
Chatterjee K, Chmelik M, Gupta R, Kanodia A. 2015. Qualitative analysis of POMDPs with temporal logic specifications for robotics applications. ICRA: International Conference on Robotics and Automation 325–330.
View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[16]
2015 | Conference Paper | IST-REx-ID: 1820 | OA
Chatterjee K, Chmelik M, Gupta R, Kanodia A. 2015. Optimal cost almost-sure reachability in POMDPs. Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence . IAAI: Innovative Applications of Artificial Intelligence, Artifical Intelligence, vol. 5. 3496–3502.
View | Files available | Download Preprint (ext.) | arXiv
 
[15]
2015 | Journal Article | IST-REx-ID: 1873 | OA
Chatterjee K, Chmelik M. 2015. POMDPs under probabilistic semantics. Artificial Intelligence. 221, 46–72.
View | DOI | Download Preprint (ext.) | arXiv
 
[14]
2015 | Journal Article | IST-REx-ID: 1501 | OA
Chatterjee K, Chmelik M, Daca P. 2015. CEGAR for compositional analysis of qualitative properties in Markov decision processes. Formal Methods in System Design. 47(2), 230–264.
View | Files available | DOI | Download Preprint (ext.)
 
[13]
2014 | Conference Paper | IST-REx-ID: 2027 | OA
Brázdil T, Chatterjee K, Chmelik M, Forejt V, Kretinsky J, Kwiatkowska M, Parker D, Ujma M. 2014. Verification of markov decision processes using learning algorithms. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). ALENEX: Algorithm Engineering and Experiments, LNCS, vol. 8837. 98–114.
View | DOI | Download Submitted Version (ext.)
 
[12]
2014 | Conference Paper | IST-REx-ID: 2063
Chatterjee K, Chmelik M, Daca P. 2014. CEGAR for qualitative analysis of probabilistic systems. CAV: Computer Aided Verification, LNCS, vol. 8559. 473–490.
View | Files available | DOI
 
[11]
2014 | Technical Report | IST-REx-ID: 5412 | OA
Chatterjee K, Daca P, Chmelik M. 2014. CEGAR for qualitative analysis of probabilistic systems, IST Austria, 31p.
View | Files available | DOI
 
[10]
2014 | Technical Report | IST-REx-ID: 5413 | OA
Chatterjee K, Daca P, Chmelik M. 2014. CEGAR for qualitative analysis of probabilistic systems, IST Austria, 33p.
View | Files available | DOI
 
[9]
2014 | Technical Report | IST-REx-ID: 5414 | OA
Chatterjee K, Daca P, Chmelik M. 2014. CEGAR for qualitative analysis of probabilistic systems, IST Austria, 33p.
View | Files available | DOI
 
[8]
2014 | Technical Report | IST-REx-ID: 5424 | OA
Chatterjee K, Chmelik M, Gupta R, Kanodia A. 2014. Qualitative analysis of POMDPs with temporal logic specifications for robotics applications, IST Austria, 12p.
View | Files available | DOI
 
[7]
2014 | Technical Report | IST-REx-ID: 5426 | OA
Chatterjee K, Chmelik M, Gupta R, Kanodia A. 2014. Qualitative analysis of POMDPs with temporal logic specifications for robotics applications, IST Austria, 10p.
View | Files available | DOI
 
[6]
2014 | Journal Article | IST-REx-ID: 1733 | OA
Cerny P, Chmelik M, Henzinger TA, Radhakrishna A. 2014. Interface simulation distances. Theoretical Computer Science. 560(3), 348–363.
View | Files available | DOI | Download Submitted Version (ext.)
 
[5]
2013 | Conference Paper | IST-REx-ID: 2295 | OA
Chatterjee K, Chmelik M, Tracol M. 2013. What is decidable about partially observable Markov decision processes with omega-regular objectives. 23, 165–180.
View | Files available | DOI
 
[4]
2013 | Technical Report | IST-REx-ID: 5400 | OA
Chatterjee K, Chmelik M, Tracol M. 2013. What is decidable about partially observable Markov decision processes with ω-regular objectives, IST Austria, 41p.
View | Files available | DOI
 
[3]
2013 | Conference Paper | IST-REx-ID: 2886 | OA
Chmelik M, Řehák V. 2013. Controllable-choice message sequence graphs. 7721, 118–130.
View | DOI | Download Submitted Version (ext.)
 
[2]
2012 | Conference Paper | IST-REx-ID: 2916 | OA
Cerny P, Chmelik M, Henzinger TA, Radhakrishna A. 2012. Interface Simulation Distances. Electronic Proceedings in Theoretical Computer Science. GandALF: Games, Automata, Logic, and Formal Verification vol. 96. 29–42.
View | Files available | DOI | Download Submitted Version (ext.) | arXiv
 
[1]
2012 | Conference Paper | IST-REx-ID: 2947 | OA
Chatterjee K, Chmelik M, Majumdar R. 2012. Equivalence of games with probabilistic uncertainty and partial observation games. ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 7561. 385–399.
View | DOI | Download Preprint (ext.)
 

Search

Filter Publications

30 Publications

Mark all

[30]
2020 | Conference Paper | IST-REx-ID: 8193
Chatterjee K, Chmelik M, Karkhanis D, Novotný P, Royer A. 2020. Multiple-environment Markov decision processes: Efficient analysis and applications. Proceedings of the 30th International Conference on Automated Planning and Scheduling. ICAPS: International Conference on Automated Planning and Scheduling vol. 30. 48–56.
View | Files available
 
[29]
2017 | Journal Article | IST-REx-ID: 1407 | OA
Svoreňová M, Kretinsky J, Chmelik M, Chatterjee K, Cěrná I, Belta C. 2017. Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games. Nonlinear Analysis: Hybrid Systems. 23(2), 230–253.
View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[28]
2016 | Conference Paper | IST-REx-ID: 1324
Chatterjee K, Chmelik M. 2016. Indefinite-horizon reachability in Goal-DEC-POMDPs. Proceedings of the Twenty-Sixth International Conference on International Conference on Automated Planning and Scheduling. ICAPS: International Conference on Automated Planning and Scheduling vol. 2016–January. 88–96.
View | Download None (ext.)
 
[27]
2016 | Conference Paper | IST-REx-ID: 1327 | OA
Brázdil T, Chatterjee K, Chmelik M, Gupta A, Novotny P. 2016. Stochastic shortest path with energy constraints in POMDPs. Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems. AAMAS: Autonomous Agents & Multiagent Systems 1465–1466.
View | Download Preprint (ext.)
 
[26]
2016 | Thesis | IST-REx-ID: 1397
Chmelik M. 2016. Algorithms for partially observable markov decision processes, IST Austria, 232p.
View
 
[25]
2016 | Journal Article | IST-REx-ID: 1477 | OA
Chatterjee K, Chmelik M, Tracol M. 2016. What is decidable about partially observable Markov decision processes with ω-regular objectives. Journal of Computer and System Sciences. 82(5), 878–911.
View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[24]
2016 | Journal Article | IST-REx-ID: 1518 | OA
Lohse K, Chmelik M, Martin S, Barton NH. 2016. Efficient strategies for calculating blockwise likelihoods under the coalescent. Genetics. 202(2), 775–786.
View | Files available | DOI
 
[23]
2016 | Journal Article | IST-REx-ID: 1529 | OA
Chatterjee K, Chmelik M, Gupta R, Kanodia A. 2016. Optimal cost almost-sure reachability in POMDPs. Artificial Intelligence. 234, 26–48.
View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[22]
2016 | Conference Paper | IST-REx-ID: 1166
Chatterjee K, Chmelik M, Davies J. 2016. A symbolic SAT based algorithm for almost sure reachability with small strategies in pomdps. Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence. AAAI: Conference on Artificial Intelligence vol. 2016. 3225–3232.
View | Files available
 
[21]
2015 | Technical Report | IST-REx-ID: 5443 | OA
Chatterjee K, Chmelik M, Davies J. 2015. A symbolic SAT-based algorithm for almost-sure reachability with small strategies in POMDPs, IST Austria, 23p.
View | Files available | DOI
 
[20]
2015 | Conference Paper | IST-REx-ID: 1603 | OA
Brázdil T, Chatterjee K, Chmelik M, Fellner A, Kretinsky J. 2015. Counterexample explanation by learning small strategies in Markov decision processes. CAV: Computer Aided Verification, LNCS, vol. 9206. 158–177.
View | Files available | DOI | Download Preprint (ext.)
 
[19]
2015 | Conference Paper | IST-REx-ID: 1689 | OA
Svoreňová M, Kretinsky J, Chmelik M, Chatterjee K, Cěrná I, Belta C. 2015. Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games. Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control. HSCC: Hybrid Systems - Computation and Control 259–268.
View | Files available | DOI | Download Preprint (ext.)
 
[18]
2015 | Conference Paper | IST-REx-ID: 1691
Svoreňová M, Chmelik M, Leahy K, Eniser H, Chatterjee K, Cěrná I, Belta C. 2015. Temporal logic motion planning using POMDPs with parity objectives: Case study paper. Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control. HSCC: Hybrid Systems - Computation and Control 233–238.
View | DOI
 
[17]
2015 | Conference Paper | IST-REx-ID: 1732 | OA
Chatterjee K, Chmelik M, Gupta R, Kanodia A. 2015. Qualitative analysis of POMDPs with temporal logic specifications for robotics applications. ICRA: International Conference on Robotics and Automation 325–330.
View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[16]
2015 | Conference Paper | IST-REx-ID: 1820 | OA
Chatterjee K, Chmelik M, Gupta R, Kanodia A. 2015. Optimal cost almost-sure reachability in POMDPs. Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence . IAAI: Innovative Applications of Artificial Intelligence, Artifical Intelligence, vol. 5. 3496–3502.
View | Files available | Download Preprint (ext.) | arXiv
 
[15]
2015 | Journal Article | IST-REx-ID: 1873 | OA
Chatterjee K, Chmelik M. 2015. POMDPs under probabilistic semantics. Artificial Intelligence. 221, 46–72.
View | DOI | Download Preprint (ext.) | arXiv
 
[14]
2015 | Journal Article | IST-REx-ID: 1501 | OA
Chatterjee K, Chmelik M, Daca P. 2015. CEGAR for compositional analysis of qualitative properties in Markov decision processes. Formal Methods in System Design. 47(2), 230–264.
View | Files available | DOI | Download Preprint (ext.)
 
[13]
2014 | Conference Paper | IST-REx-ID: 2027 | OA
Brázdil T, Chatterjee K, Chmelik M, Forejt V, Kretinsky J, Kwiatkowska M, Parker D, Ujma M. 2014. Verification of markov decision processes using learning algorithms. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). ALENEX: Algorithm Engineering and Experiments, LNCS, vol. 8837. 98–114.
View | DOI | Download Submitted Version (ext.)
 
[12]
2014 | Conference Paper | IST-REx-ID: 2063
Chatterjee K, Chmelik M, Daca P. 2014. CEGAR for qualitative analysis of probabilistic systems. CAV: Computer Aided Verification, LNCS, vol. 8559. 473–490.
View | Files available | DOI
 
[11]
2014 | Technical Report | IST-REx-ID: 5412 | OA
Chatterjee K, Daca P, Chmelik M. 2014. CEGAR for qualitative analysis of probabilistic systems, IST Austria, 31p.
View | Files available | DOI
 
[10]
2014 | Technical Report | IST-REx-ID: 5413 | OA
Chatterjee K, Daca P, Chmelik M. 2014. CEGAR for qualitative analysis of probabilistic systems, IST Austria, 33p.
View | Files available | DOI
 
[9]
2014 | Technical Report | IST-REx-ID: 5414 | OA
Chatterjee K, Daca P, Chmelik M. 2014. CEGAR for qualitative analysis of probabilistic systems, IST Austria, 33p.
View | Files available | DOI
 
[8]
2014 | Technical Report | IST-REx-ID: 5424 | OA
Chatterjee K, Chmelik M, Gupta R, Kanodia A. 2014. Qualitative analysis of POMDPs with temporal logic specifications for robotics applications, IST Austria, 12p.
View | Files available | DOI
 
[7]
2014 | Technical Report | IST-REx-ID: 5426 | OA
Chatterjee K, Chmelik M, Gupta R, Kanodia A. 2014. Qualitative analysis of POMDPs with temporal logic specifications for robotics applications, IST Austria, 10p.
View | Files available | DOI
 
[6]
2014 | Journal Article | IST-REx-ID: 1733 | OA
Cerny P, Chmelik M, Henzinger TA, Radhakrishna A. 2014. Interface simulation distances. Theoretical Computer Science. 560(3), 348–363.
View | Files available | DOI | Download Submitted Version (ext.)
 
[5]
2013 | Conference Paper | IST-REx-ID: 2295 | OA
Chatterjee K, Chmelik M, Tracol M. 2013. What is decidable about partially observable Markov decision processes with omega-regular objectives. 23, 165–180.
View | Files available | DOI
 
[4]
2013 | Technical Report | IST-REx-ID: 5400 | OA
Chatterjee K, Chmelik M, Tracol M. 2013. What is decidable about partially observable Markov decision processes with ω-regular objectives, IST Austria, 41p.
View | Files available | DOI
 
[3]
2013 | Conference Paper | IST-REx-ID: 2886 | OA
Chmelik M, Řehák V. 2013. Controllable-choice message sequence graphs. 7721, 118–130.
View | DOI | Download Submitted Version (ext.)
 
[2]
2012 | Conference Paper | IST-REx-ID: 2916 | OA
Cerny P, Chmelik M, Henzinger TA, Radhakrishna A. 2012. Interface Simulation Distances. Electronic Proceedings in Theoretical Computer Science. GandALF: Games, Automata, Logic, and Formal Verification vol. 96. 29–42.
View | Files available | DOI | Download Submitted Version (ext.) | arXiv
 
[1]
2012 | Conference Paper | IST-REx-ID: 2947 | OA
Chatterjee K, Chmelik M, Majumdar R. 2012. Equivalence of games with probabilistic uncertainty and partial observation games. ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 7561. 385–399.
View | DOI | Download Preprint (ext.)
 

Search

Filter Publications