Mathieu Tracol

Chatterjee Group

6 Publications

Mark all

[6]
2016 | Published | Journal Article | IST-REx-ID: 1477 | OA
Chatterjee K, Chmelik M, Tracol M. What is decidable about partially observable Markov decision processes with ω-regular objectives. Journal of Computer and System Sciences. 2016;82(5):878-911. doi:10.1016/j.jcss.2016.02.009
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[5]
2013 | Published | Technical Report | IST-REx-ID: 5400 | OA
Chatterjee K, Chmelik M, Tracol M. What Is Decidable about Partially Observable Markov Decision Processes with ω-Regular Objectives. IST Austria; 2013. doi:10.15479/AT:IST-2013-109-v1-1
[Published Version] View | Files available | DOI
 
[4]
2013 | Published | Conference Paper | IST-REx-ID: 2295 | OA
Chatterjee K, Chmelik M, Tracol M. What is decidable about partially observable Markov decision processes with omega-regular objectives. 2013;23:165-180. doi:10.4230/LIPIcs.CSL.2013.165
[Published Version] View | Files available | DOI
 
[3]
2012 | Published | Conference Paper | IST-REx-ID: 2957 | OA
Chatterjee K, Tracol M. Decidable problems for probabilistic automata on infinite words. In: Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. IEEE; 2012. doi:10.1109/LICS.2012.29
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[2]
2011 | Submitted | 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 | Published | Technical Report | IST-REx-ID: 5384 | OA
Chatterjee K, Tracol M. Decidable Problems for Probabilistic Automata on Infinite Words. IST Austria; 2011. doi:10.15479/AT:IST-2011-0004
[Published Version] View | Files available | DOI
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: AMA

Export / Embed

Grants


6 Publications

Mark all

[6]
2016 | Published | Journal Article | IST-REx-ID: 1477 | OA
Chatterjee K, Chmelik M, Tracol M. What is decidable about partially observable Markov decision processes with ω-regular objectives. Journal of Computer and System Sciences. 2016;82(5):878-911. doi:10.1016/j.jcss.2016.02.009
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[5]
2013 | Published | Technical Report | IST-REx-ID: 5400 | OA
Chatterjee K, Chmelik M, Tracol M. What Is Decidable about Partially Observable Markov Decision Processes with ω-Regular Objectives. IST Austria; 2013. doi:10.15479/AT:IST-2013-109-v1-1
[Published Version] View | Files available | DOI
 
[4]
2013 | Published | Conference Paper | IST-REx-ID: 2295 | OA
Chatterjee K, Chmelik M, Tracol M. What is decidable about partially observable Markov decision processes with omega-regular objectives. 2013;23:165-180. doi:10.4230/LIPIcs.CSL.2013.165
[Published Version] View | Files available | DOI
 
[3]
2012 | Published | Conference Paper | IST-REx-ID: 2957 | OA
Chatterjee K, Tracol M. Decidable problems for probabilistic automata on infinite words. In: Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. IEEE; 2012. doi:10.1109/LICS.2012.29
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[2]
2011 | Submitted | 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 | Published | Technical Report | IST-REx-ID: 5384 | OA
Chatterjee K, Tracol M. Decidable Problems for Probabilistic Automata on Infinite Words. IST Austria; 2011. doi:10.15479/AT:IST-2011-0004
[Published Version] View | Files available | DOI
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: AMA

Export / Embed