Mathieu Tracol

Chatterjee Group

6 Publications

Mark all

[6]
2016 | Published | Journal Article | IST-REx-ID: 1477 | OA
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. Elsevier, pp. 878–911, 2016.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[5]
2013 | Published | 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.
[Published Version] View | Files available | DOI
 
[4]
2013 | Published | 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.
[Published Version] View | Files available | DOI
 
[3]
2012 | Published | Conference Paper | IST-REx-ID: 2957 | OA
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.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[2]
2011 | Submitted | Preprint | IST-REx-ID: 3363 | OA
K. Chatterjee, T. A. Henzinger, and M. Tracol, “The decidability frontier for probabilistic automata on infinite words.” ArXiv.
[Preprint] View | Download Preprint (ext.) | arXiv
 
[1]
2011 | Published | Technical Report | IST-REx-ID: 5384 | OA
K. Chatterjee and M. Tracol, Decidable problems for probabilistic automata on infinite words. IST Austria, 2011.
[Published Version] View | Files available | DOI
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed

Grants


6 Publications

Mark all

[6]
2016 | Published | Journal Article | IST-REx-ID: 1477 | OA
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. Elsevier, pp. 878–911, 2016.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[5]
2013 | Published | 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.
[Published Version] View | Files available | DOI
 
[4]
2013 | Published | 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.
[Published Version] View | Files available | DOI
 
[3]
2012 | Published | Conference Paper | IST-REx-ID: 2957 | OA
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.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[2]
2011 | Submitted | Preprint | IST-REx-ID: 3363 | OA
K. Chatterjee, T. A. Henzinger, and M. Tracol, “The decidability frontier for probabilistic automata on infinite words.” ArXiv.
[Preprint] View | Download Preprint (ext.) | arXiv
 
[1]
2011 | Published | Technical Report | IST-REx-ID: 5384 | OA
K. Chatterjee and M. Tracol, Decidable problems for probabilistic automata on infinite words. IST Austria, 2011.
[Published Version] View | Files available | DOI
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed