Mathieu Tracol

Chatterjee Group

6 Publications

Mark all

[6]
2016 | Published | Journal Article | IST-REx-ID: 1477 | OA
What is decidable about partially observable Markov decision processes with ω-regular objectives
K. Chatterjee, M. Chmelik, M. Tracol, Journal of Computer and System Sciences 82 (2016) 878–911.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[5]
2013 | Published | Technical Report | IST-REx-ID: 5400 | OA
What is decidable about partially observable Markov decision processes with ω-regular objectives
K. Chatterjee, M. Chmelik, 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
What is decidable about partially observable Markov decision processes with omega-regular objectives
K. Chatterjee, M. Chmelik, M. Tracol, 23 (2013) 165–180.
[Published Version] View | Files available | DOI
 
[3]
2012 | Published | Conference Paper | IST-REx-ID: 2957 | OA
Decidable problems for probabilistic automata on infinite words
K. Chatterjee, M. Tracol, in:, Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, IEEE, 2012.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[2]
2011 | Submitted | Preprint | IST-REx-ID: 3363 | OA
The decidability frontier for probabilistic automata on infinite words
K. Chatterjee, T.A. Henzinger, M. Tracol, (n.d.).
[Preprint] View | Download Preprint (ext.) | arXiv
 
[1]
2011 | Published | Technical Report | IST-REx-ID: 5384 | OA
Decidable problems for probabilistic automata on infinite words
K. Chatterjee, 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

Export / Embed

Grants


6 Publications

Mark all

[6]
2016 | Published | Journal Article | IST-REx-ID: 1477 | OA
What is decidable about partially observable Markov decision processes with ω-regular objectives
K. Chatterjee, M. Chmelik, M. Tracol, Journal of Computer and System Sciences 82 (2016) 878–911.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[5]
2013 | Published | Technical Report | IST-REx-ID: 5400 | OA
What is decidable about partially observable Markov decision processes with ω-regular objectives
K. Chatterjee, M. Chmelik, 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
What is decidable about partially observable Markov decision processes with omega-regular objectives
K. Chatterjee, M. Chmelik, M. Tracol, 23 (2013) 165–180.
[Published Version] View | Files available | DOI
 
[3]
2012 | Published | Conference Paper | IST-REx-ID: 2957 | OA
Decidable problems for probabilistic automata on infinite words
K. Chatterjee, M. Tracol, in:, Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, IEEE, 2012.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[2]
2011 | Submitted | Preprint | IST-REx-ID: 3363 | OA
The decidability frontier for probabilistic automata on infinite words
K. Chatterjee, T.A. Henzinger, M. Tracol, (n.d.).
[Preprint] View | Download Preprint (ext.) | arXiv
 
[1]
2011 | Published | Technical Report | IST-REx-ID: 5384 | OA
Decidable problems for probabilistic automata on infinite words
K. Chatterjee, 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

Export / Embed