6 Publications

Mark all

[6]
2016 | Journal Article | IST-REx-ID: 1477
Chatterjee, Krishnendu, et al. “What Is Decidable about Partially Observable Markov Decision Processes with ω-Regular Objectives.” Journal of Computer and System Sciences, vol. 82, no. 5, Elsevier, 2016, pp. 878–911, doi:10.1016/j.jcss.2016.02.009.
View | Files available | DOI | Download (ext.) | arXiv
 
[5]
2013 | Technical Report | IST-REx-ID: 5400   OA
Chatterjee, Krishnendu, et al. What Is Decidable about Partially Observable Markov Decision Processes with ω-Regular Objectives. IST Austria, 2013, doi:10.15479/AT:IST-2013-109-v1-1.
View | Files available | DOI
 
[4]
2013 | Conference Paper | IST-REx-ID: 2295
Chatterjee, Krishnendu, et al. What Is Decidable about Partially Observable Markov Decision Processes with Omega-Regular Objectives. Vol. 23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013, pp. 165–80, doi:10.4230/LIPIcs.CSL.2013.165.
View | Files available | DOI
 
[3]
2012 | Conference Paper | IST-REx-ID: 2957
Chatterjee, Krishnendu, and Mathieu Tracol. “Decidable Problems for Probabilistic Automata on Infinite Words.” Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, IEEE, 2012, p. 6280437, doi:10.1109/LICS.2012.29.
View | Files available | DOI | Download (ext.) | arXiv
 
[2]
2011 | Technical Report | IST-REx-ID: 5384   OA
Chatterjee, Krishnendu, and Mathieu Tracol. Decidable Problems for Probabilistic Automata on Infinite Words. IST Austria, 2011, doi:10.15479/AT:IST-2011-0004.
View | Files available | DOI
 
[1]
2011 | Preprint | IST-REx-ID: 3363   OA
Chatterjee, Krishnendu, et al. The Decidability Frontier for Probabilistic Automata on Infinite Words. ArXiv.
View | Download (ext.) | arXiv
 

Search

Filter Publications

Display / Sort

Citation Style: MLA

Export / Embed

6 Publications

Mark all

[6]
2016 | Journal Article | IST-REx-ID: 1477
Chatterjee, Krishnendu, et al. “What Is Decidable about Partially Observable Markov Decision Processes with ω-Regular Objectives.” Journal of Computer and System Sciences, vol. 82, no. 5, Elsevier, 2016, pp. 878–911, doi:10.1016/j.jcss.2016.02.009.
View | Files available | DOI | Download (ext.) | arXiv
 
[5]
2013 | Technical Report | IST-REx-ID: 5400   OA
Chatterjee, Krishnendu, et al. What Is Decidable about Partially Observable Markov Decision Processes with ω-Regular Objectives. IST Austria, 2013, doi:10.15479/AT:IST-2013-109-v1-1.
View | Files available | DOI
 
[4]
2013 | Conference Paper | IST-REx-ID: 2295
Chatterjee, Krishnendu, et al. What Is Decidable about Partially Observable Markov Decision Processes with Omega-Regular Objectives. Vol. 23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013, pp. 165–80, doi:10.4230/LIPIcs.CSL.2013.165.
View | Files available | DOI
 
[3]
2012 | Conference Paper | IST-REx-ID: 2957
Chatterjee, Krishnendu, and Mathieu Tracol. “Decidable Problems for Probabilistic Automata on Infinite Words.” Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, IEEE, 2012, p. 6280437, doi:10.1109/LICS.2012.29.
View | Files available | DOI | Download (ext.) | arXiv
 
[2]
2011 | Technical Report | IST-REx-ID: 5384   OA
Chatterjee, Krishnendu, and Mathieu Tracol. Decidable Problems for Probabilistic Automata on Infinite Words. IST Austria, 2011, doi:10.15479/AT:IST-2011-0004.
View | Files available | DOI
 
[1]
2011 | Preprint | IST-REx-ID: 3363   OA
Chatterjee, Krishnendu, et al. The Decidability Frontier for Probabilistic Automata on Infinite Words. ArXiv.
View | Download (ext.) | arXiv
 

Search

Filter Publications

Display / Sort

Citation Style: MLA

Export / Embed