29 Publications

Mark all

[29]
2017 | Journal Article | IST-REx-ID: 1407
M. Svoreňová, J. Kretinsky, M. Chmelik, K. Chatterjee, I. Cěrná, and C. Belta, “Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games,” Nonlinear Analysis: Hybrid Systems, vol. 23, no. 2, pp. 230–253, 2017.
View | Files available | DOI | Download (ext.) | arXiv
 
[28]
2016 | Conference Paper | IST-REx-ID: 1166
K. Chatterjee, M. Chmelik, and J. Davies, “A symbolic SAT based algorithm for almost sure reachability with small strategies in pomdps,” in Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, Phoenix, AZ, USA, 2016, vol. 2016, pp. 3225–3232.
View | Files available
 
[27]
2016 | Journal Article | IST-REx-ID: 1477
K. Chatterjee, M. Chmelik, and M. Tracol, “What is decidable about partially observable Markov decision processes with ω-regular objectives,” Journal of Computer and System Sciences, vol. 82, no. 5, pp. 878–911, 2016.
View | Files available | DOI | Download (ext.) | arXiv
 
[26]
2016 | Conference Paper | IST-REx-ID: 1327   OA
T. Brázdil, K. Chatterjee, M. Chmelik, A. Gupta, and P. Novotny, “Stochastic shortest path with energy constraints in POMDPs,” in Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems, Singapore, 2016, pp. 1465–1466.
View | Download (ext.)
 
[25]
2016 | Journal Article | IST-REx-ID: 1529
K. Chatterjee, M. Chmelik, R. Gupta, and A. Kanodia, “Optimal cost almost-sure reachability in POMDPs,” Artificial Intelligence, vol. 234, pp. 26–48, 2016.
View | Files available | DOI | Download (ext.) | arXiv
 
[24]
2016 | Thesis | IST-REx-ID: 1397
M. Chmelik, Algorithms for partially observable markov decision processes. IST Austria, 2016.
View
 
[23]
2016 | Journal Article | IST-REx-ID: 1518   OA
K. Lohse, M. Chmelik, S. Martin, and N. H. Barton, “Efficient strategies for calculating blockwise likelihoods under the coalescent,” Genetics, vol. 202, no. 2, pp. 775–786, 2016.
View | Files available | DOI
 
[22]
2016 | Conference Paper | IST-REx-ID: 1324
K. Chatterjee and M. Chmelik, “Indefinite-horizon reachability in Goal-DEC-POMDPs,” in Proceedings of the Twenty-Sixth International Conference on International Conference on Automated Planning and Scheduling, London, United Kingdom, 2016, vol. 2016–January, pp. 88–96.
View | Download (ext.)
 
[21]
2015 | Conference Paper | IST-REx-ID: 1820   OA
K. Chatterjee, M. Chmelik, R. Gupta, and A. Kanodia, “Optimal cost almost-sure reachability in POMDPs,” in Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence , Austin, TX, USA, 2015, vol. 5, pp. 3496–3502.
View | Files available | Download (ext.) | arXiv
 
[20]
2015 | Technical Report | IST-REx-ID: 5443
K. Chatterjee, M. Chmelik, and J. Davies, A symbolic SAT-based algorithm for almost-sure reachability with small strategies in POMDPs. IST Austria, 2015.
View | Files available | DOI
 
[19]
2015 | Conference Paper | IST-REx-ID: 1732   OA
K. Chatterjee, M. Chmelik, R. Gupta, and A. Kanodia, “Qualitative analysis of POMDPs with temporal logic specifications for robotics applications,” presented at the ICRA: International Conference on Robotics and Automation, Seattle, WA, United States, 2015, pp. 325–330.
View | Files available | DOI | Download (ext.) | arXiv
 
[18]
2015 | Journal Article | IST-REx-ID: 1873   OA
K. Chatterjee and M. Chmelik, “POMDPs under probabilistic semantics,” Artificial Intelligence, vol. 221, pp. 46–72, 2015.
View | DOI | Download (ext.) | arXiv
 
[17]
2015 | Journal Article | IST-REx-ID: 1501   OA
K. Chatterjee, M. Chmelik, and P. Daca, “CEGAR for compositional analysis of qualitative properties in Markov decision processes,” Formal Methods in System Design, vol. 47, no. 2, pp. 230–264, 2015.
View | Files available | DOI | Download (ext.)
 
[16]
2015 | Conference Paper | IST-REx-ID: 1689   OA
M. Svoreňová, J. Kretinsky, M. Chmelik, K. Chatterjee, I. Cěrná, and C. Belta, “Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games,” in Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control, Seattle, WA, United States, 2015, pp. 259–268.
View | Files available | DOI | Download (ext.)
 
[15]
2015 | Conference Paper | IST-REx-ID: 1691
M. Svoreňová et al., “Temporal logic motion planning using POMDPs with parity objectives: Case study paper,” in Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control, Seattle, WA, United States, 2015, pp. 233–238.
View | DOI
 
[14]
2015 | Conference Paper | IST-REx-ID: 1603
T. Brázdil, K. Chatterjee, M. Chmelik, A. Fellner, and J. Kretinsky, “Counterexample explanation by learning small strategies in Markov decision processes,” presented at the CAV: Computer Aided Verification, San Francisco, CA, United States, 2015, vol. 9206, pp. 158–177.
View | Files available | DOI | Download (ext.)
 
[13]
2014 | Conference Paper | IST-REx-ID: 2063
K. Chatterjee, M. Chmelik, and P. Daca, “CEGAR for qualitative analysis of probabilistic systems,” presented at the CAV: Computer Aided Verification, Vienna, Austria, 2014, vol. 8559, pp. 473–490.
View | Files available | DOI
 
[12]
2014 | Technical Report | IST-REx-ID: 5424
K. Chatterjee, M. Chmelik, R. Gupta, and A. Kanodia, Qualitative analysis of POMDPs with temporal logic specifications for robotics applications. IST Austria, 2014.
View | Files available | DOI
 
[11]
2014 | Technical Report | IST-REx-ID: 5412
K. Chatterjee, P. Daca, and M. Chmelik, CEGAR for qualitative analysis of probabilistic systems. IST Austria, 2014.
View | Files available | DOI
 
[10]
2014 | Conference Paper | IST-REx-ID: 2027   OA
T. Brázdil et al., “Verification of markov decision processes using learning algorithms,” in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Sydney, Australia, 2014, vol. 8837, pp. 98–114.
View | DOI | Download (ext.)
 
[9]
2014 | Technical Report | IST-REx-ID: 5413
K. Chatterjee, P. Daca, and M. Chmelik, CEGAR for qualitative analysis of probabilistic systems. IST Austria, 2014.
View | Files available | DOI
 
[8]
2014 | Journal Article | IST-REx-ID: 1733
P. Cerny, M. Chmelik, T. A. Henzinger, and A. Radhakrishna, “Interface simulation distances,” Theoretical Computer Science, vol. 560, no. 3, pp. 348–363, 2014.
View | Files available | DOI | Download (ext.)
 
[7]
2014 | Technical Report | IST-REx-ID: 5426
K. Chatterjee, M. Chmelik, R. Gupta, and A. Kanodia, Qualitative analysis of POMDPs with temporal logic specifications for robotics applications. IST Austria, 2014.
View | Files available | DOI
 
[6]
2014 | Technical Report | IST-REx-ID: 5414
K. Chatterjee, P. Daca, and M. Chmelik, CEGAR for qualitative analysis of probabilistic systems. IST Austria, 2014.
View | Files available | DOI
 
[5]
2013 | Technical Report | IST-REx-ID: 5400
K. Chatterjee, M. Chmelik, and M. Tracol, What is decidable about partially observable Markov decision processes with ω-regular objectives. IST Austria, 2013.
View | Files available | DOI
 
[4]
2013 | Conference Paper | IST-REx-ID: 2886   OA
M. Chmelik and V. Řehák, “Controllable-choice message sequence graphs,” vol. 7721. Springer, pp. 118–130, 2013.
View | DOI | Download (ext.)
 
[3]
2013 | Conference Paper | IST-REx-ID: 2295   OA
K. Chatterjee, M. Chmelik, and M. Tracol, “What is decidable about partially observable Markov decision processes with omega-regular objectives,” vol. 23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp. 165–180, 2013.
View | Files available | DOI
 
[2]
2012 | Conference Paper | IST-REx-ID: 2916   OA
P. Cerny, M. Chmelik, T. A. Henzinger, and A. Radhakrishna, “Interface Simulation Distances,” in Electronic Proceedings in Theoretical Computer Science, Napoli, Italy, 2012, vol. 96, pp. 29–42.
View | Files available | DOI | Download (ext.) | arXiv
 
[1]
2012 | Conference Paper | IST-REx-ID: 2947   OA
K. Chatterjee, M. Chmelik, and R. Majumdar, “Equivalence of games with probabilistic uncertainty and partial observation games,” presented at the ATVA: Automated Technology for Verification and Analysis, Thiruvananthapuram, India, 2012, vol. 7561, pp. 385–399.
View | DOI | Download (ext.)
 

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed

29 Publications

Mark all

[29]
2017 | Journal Article | IST-REx-ID: 1407
M. Svoreňová, J. Kretinsky, M. Chmelik, K. Chatterjee, I. Cěrná, and C. Belta, “Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games,” Nonlinear Analysis: Hybrid Systems, vol. 23, no. 2, pp. 230–253, 2017.
View | Files available | DOI | Download (ext.) | arXiv
 
[28]
2016 | Conference Paper | IST-REx-ID: 1166
K. Chatterjee, M. Chmelik, and J. Davies, “A symbolic SAT based algorithm for almost sure reachability with small strategies in pomdps,” in Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, Phoenix, AZ, USA, 2016, vol. 2016, pp. 3225–3232.
View | Files available
 
[27]
2016 | Journal Article | IST-REx-ID: 1477
K. Chatterjee, M. Chmelik, and M. Tracol, “What is decidable about partially observable Markov decision processes with ω-regular objectives,” Journal of Computer and System Sciences, vol. 82, no. 5, pp. 878–911, 2016.
View | Files available | DOI | Download (ext.) | arXiv
 
[26]
2016 | Conference Paper | IST-REx-ID: 1327   OA
T. Brázdil, K. Chatterjee, M. Chmelik, A. Gupta, and P. Novotny, “Stochastic shortest path with energy constraints in POMDPs,” in Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems, Singapore, 2016, pp. 1465–1466.
View | Download (ext.)
 
[25]
2016 | Journal Article | IST-REx-ID: 1529
K. Chatterjee, M. Chmelik, R. Gupta, and A. Kanodia, “Optimal cost almost-sure reachability in POMDPs,” Artificial Intelligence, vol. 234, pp. 26–48, 2016.
View | Files available | DOI | Download (ext.) | arXiv
 
[24]
2016 | Thesis | IST-REx-ID: 1397
M. Chmelik, Algorithms for partially observable markov decision processes. IST Austria, 2016.
View
 
[23]
2016 | Journal Article | IST-REx-ID: 1518   OA
K. Lohse, M. Chmelik, S. Martin, and N. H. Barton, “Efficient strategies for calculating blockwise likelihoods under the coalescent,” Genetics, vol. 202, no. 2, pp. 775–786, 2016.
View | Files available | DOI
 
[22]
2016 | Conference Paper | IST-REx-ID: 1324
K. Chatterjee and M. Chmelik, “Indefinite-horizon reachability in Goal-DEC-POMDPs,” in Proceedings of the Twenty-Sixth International Conference on International Conference on Automated Planning and Scheduling, London, United Kingdom, 2016, vol. 2016–January, pp. 88–96.
View | Download (ext.)
 
[21]
2015 | Conference Paper | IST-REx-ID: 1820   OA
K. Chatterjee, M. Chmelik, R. Gupta, and A. Kanodia, “Optimal cost almost-sure reachability in POMDPs,” in Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence , Austin, TX, USA, 2015, vol. 5, pp. 3496–3502.
View | Files available | Download (ext.) | arXiv
 
[20]
2015 | Technical Report | IST-REx-ID: 5443
K. Chatterjee, M. Chmelik, and J. Davies, A symbolic SAT-based algorithm for almost-sure reachability with small strategies in POMDPs. IST Austria, 2015.
View | Files available | DOI
 
[19]
2015 | Conference Paper | IST-REx-ID: 1732   OA
K. Chatterjee, M. Chmelik, R. Gupta, and A. Kanodia, “Qualitative analysis of POMDPs with temporal logic specifications for robotics applications,” presented at the ICRA: International Conference on Robotics and Automation, Seattle, WA, United States, 2015, pp. 325–330.
View | Files available | DOI | Download (ext.) | arXiv
 
[18]
2015 | Journal Article | IST-REx-ID: 1873   OA
K. Chatterjee and M. Chmelik, “POMDPs under probabilistic semantics,” Artificial Intelligence, vol. 221, pp. 46–72, 2015.
View | DOI | Download (ext.) | arXiv
 
[17]
2015 | Journal Article | IST-REx-ID: 1501   OA
K. Chatterjee, M. Chmelik, and P. Daca, “CEGAR for compositional analysis of qualitative properties in Markov decision processes,” Formal Methods in System Design, vol. 47, no. 2, pp. 230–264, 2015.
View | Files available | DOI | Download (ext.)
 
[16]
2015 | Conference Paper | IST-REx-ID: 1689   OA
M. Svoreňová, J. Kretinsky, M. Chmelik, K. Chatterjee, I. Cěrná, and C. Belta, “Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games,” in Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control, Seattle, WA, United States, 2015, pp. 259–268.
View | Files available | DOI | Download (ext.)
 
[15]
2015 | Conference Paper | IST-REx-ID: 1691
M. Svoreňová et al., “Temporal logic motion planning using POMDPs with parity objectives: Case study paper,” in Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control, Seattle, WA, United States, 2015, pp. 233–238.
View | DOI
 
[14]
2015 | Conference Paper | IST-REx-ID: 1603
T. Brázdil, K. Chatterjee, M. Chmelik, A. Fellner, and J. Kretinsky, “Counterexample explanation by learning small strategies in Markov decision processes,” presented at the CAV: Computer Aided Verification, San Francisco, CA, United States, 2015, vol. 9206, pp. 158–177.
View | Files available | DOI | Download (ext.)
 
[13]
2014 | Conference Paper | IST-REx-ID: 2063
K. Chatterjee, M. Chmelik, and P. Daca, “CEGAR for qualitative analysis of probabilistic systems,” presented at the CAV: Computer Aided Verification, Vienna, Austria, 2014, vol. 8559, pp. 473–490.
View | Files available | DOI
 
[12]
2014 | Technical Report | IST-REx-ID: 5424
K. Chatterjee, M. Chmelik, R. Gupta, and A. Kanodia, Qualitative analysis of POMDPs with temporal logic specifications for robotics applications. IST Austria, 2014.
View | Files available | DOI
 
[11]
2014 | Technical Report | IST-REx-ID: 5412
K. Chatterjee, P. Daca, and M. Chmelik, CEGAR for qualitative analysis of probabilistic systems. IST Austria, 2014.
View | Files available | DOI
 
[10]
2014 | Conference Paper | IST-REx-ID: 2027   OA
T. Brázdil et al., “Verification of markov decision processes using learning algorithms,” in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Sydney, Australia, 2014, vol. 8837, pp. 98–114.
View | DOI | Download (ext.)
 
[9]
2014 | Technical Report | IST-REx-ID: 5413
K. Chatterjee, P. Daca, and M. Chmelik, CEGAR for qualitative analysis of probabilistic systems. IST Austria, 2014.
View | Files available | DOI
 
[8]
2014 | Journal Article | IST-REx-ID: 1733
P. Cerny, M. Chmelik, T. A. Henzinger, and A. Radhakrishna, “Interface simulation distances,” Theoretical Computer Science, vol. 560, no. 3, pp. 348–363, 2014.
View | Files available | DOI | Download (ext.)
 
[7]
2014 | Technical Report | IST-REx-ID: 5426
K. Chatterjee, M. Chmelik, R. Gupta, and A. Kanodia, Qualitative analysis of POMDPs with temporal logic specifications for robotics applications. IST Austria, 2014.
View | Files available | DOI
 
[6]
2014 | Technical Report | IST-REx-ID: 5414
K. Chatterjee, P. Daca, and M. Chmelik, CEGAR for qualitative analysis of probabilistic systems. IST Austria, 2014.
View | Files available | DOI
 
[5]
2013 | Technical Report | IST-REx-ID: 5400
K. Chatterjee, M. Chmelik, and M. Tracol, What is decidable about partially observable Markov decision processes with ω-regular objectives. IST Austria, 2013.
View | Files available | DOI
 
[4]
2013 | Conference Paper | IST-REx-ID: 2886   OA
M. Chmelik and V. Řehák, “Controllable-choice message sequence graphs,” vol. 7721. Springer, pp. 118–130, 2013.
View | DOI | Download (ext.)
 
[3]
2013 | Conference Paper | IST-REx-ID: 2295   OA
K. Chatterjee, M. Chmelik, and M. Tracol, “What is decidable about partially observable Markov decision processes with omega-regular objectives,” vol. 23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp. 165–180, 2013.
View | Files available | DOI
 
[2]
2012 | Conference Paper | IST-REx-ID: 2916   OA
P. Cerny, M. Chmelik, T. A. Henzinger, and A. Radhakrishna, “Interface Simulation Distances,” in Electronic Proceedings in Theoretical Computer Science, Napoli, Italy, 2012, vol. 96, pp. 29–42.
View | Files available | DOI | Download (ext.) | arXiv
 
[1]
2012 | Conference Paper | IST-REx-ID: 2947   OA
K. Chatterjee, M. Chmelik, and R. Majumdar, “Equivalence of games with probabilistic uncertainty and partial observation games,” presented at the ATVA: Automated Technology for Verification and Analysis, Thiruvananthapuram, India, 2012, vol. 7561, pp. 385–399.
View | DOI | Download (ext.)
 

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed