6 Publications

Mark all

[6]
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
 
[5]
2013 | Technical Report | IST-REx-ID: 5400   OA
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: 2295
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
 
[3]
2012 | Conference Paper | IST-REx-ID: 2957
K. Chatterjee and M. Tracol, “Decidable problems for probabilistic automata on infinite words,” in Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, Dubrovnik, Croatia , 2012, p. 6280437.
View | Files available | DOI | Download (ext.) | arXiv
 
[2]
2011 | Technical Report | IST-REx-ID: 5384   OA
K. Chatterjee and M. Tracol, Decidable problems for probabilistic automata on infinite words. IST Austria, 2011.
View | Files available | DOI
 
[1]
2011 | Preprint | IST-REx-ID: 3363   OA
K. Chatterjee, T. A. Henzinger, and M. Tracol, “The decidability frontier for probabilistic automata on infinite words.” ArXiv.
View | Download (ext.) | arXiv
 

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed

6 Publications

Mark all

[6]
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
 
[5]
2013 | Technical Report | IST-REx-ID: 5400   OA
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: 2295
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
 
[3]
2012 | Conference Paper | IST-REx-ID: 2957
K. Chatterjee and M. Tracol, “Decidable problems for probabilistic automata on infinite words,” in Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, Dubrovnik, Croatia , 2012, p. 6280437.
View | Files available | DOI | Download (ext.) | arXiv
 
[2]
2011 | Technical Report | IST-REx-ID: 5384   OA
K. Chatterjee and M. Tracol, Decidable problems for probabilistic automata on infinite words. IST Austria, 2011.
View | Files available | DOI
 
[1]
2011 | Preprint | IST-REx-ID: 3363   OA
K. Chatterjee, T. A. Henzinger, and M. Tracol, “The decidability frontier for probabilistic automata on infinite words.” ArXiv.
View | Download (ext.) | arXiv
 

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed