Mathieu Tracol

Chatterjee Group

6 Publications

Mark all

[6]
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.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[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.
[Published Version] 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.
[Published Version] View | Files available | DOI
 
[3]
2012 | Conference Paper | IST-REx-ID: 2957 | OA
Chatterjee K, Tracol M. 2012. Decidable problems for probabilistic automata on infinite words. Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Logic in Computer Science, 6280437.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[2]
2011 | Preprint | IST-REx-ID: 3363 | OA
Chatterjee K, Henzinger TA, Tracol M. The decidability frontier for probabilistic automata on infinite words.
[Preprint] View | Download Preprint (ext.) | arXiv
 
[1]
2011 | Technical Report | IST-REx-ID: 5384 | OA
Chatterjee K, Tracol M. 2011. Decidable problems for probabilistic automata on infinite words, IST Austria, 30p.
[Published Version] View | Files available | DOI
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: ISTA Annual Report

Export / Embed

6 Publications

Mark all

[6]
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.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[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.
[Published Version] 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.
[Published Version] View | Files available | DOI
 
[3]
2012 | Conference Paper | IST-REx-ID: 2957 | OA
Chatterjee K, Tracol M. 2012. Decidable problems for probabilistic automata on infinite words. Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Logic in Computer Science, 6280437.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[2]
2011 | Preprint | IST-REx-ID: 3363 | OA
Chatterjee K, Henzinger TA, Tracol M. The decidability frontier for probabilistic automata on infinite words.
[Preprint] View | Download Preprint (ext.) | arXiv
 
[1]
2011 | Technical Report | IST-REx-ID: 5384 | OA
Chatterjee K, Tracol M. 2011. Decidable problems for probabilistic automata on infinite words, IST Austria, 30p.
[Published Version] View | Files available | DOI
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: ISTA Annual Report

Export / Embed