6 Publications

Mark all

[6]
2016 | Journal Article | IST-REx-ID: 1477
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. https://doi.org/10.1016/j.jcss.2016.02.009
View | Files available | DOI | Download (ext.) | arXiv
 
[5]
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. https://doi.org/10.15479/AT:IST-2013-109-v1-1
View | Files available | DOI
 
[4]
2013 | Conference Paper | IST-REx-ID: 2295
Chatterjee, K., Chmelik, M., & Tracol, M. (2013). What is decidable about partially observable Markov decision processes with omega-regular objectives. Presented at the CSL: Computer Science Logic, Torino, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CSL.2013.165
View | Files available | DOI
 
[3]
2012 | Conference Paper | IST-REx-ID: 2957
Chatterjee, K., & Tracol, M. (2012). Decidable problems for probabilistic automata on infinite words. In Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science (p. 6280437). Dubrovnik, Croatia : IEEE. https://doi.org/10.1109/LICS.2012.29
View | Files available | DOI | Download (ext.) | arXiv
 
[2]
2011 | Technical Report | IST-REx-ID: 5384   OA
Chatterjee, K., & Tracol, M. (2011). Decidable problems for probabilistic automata on infinite words. IST Austria. https://doi.org/10.15479/AT:IST-2011-0004
View | Files available | DOI
 
[1]
2011 | Preprint | IST-REx-ID: 3363   OA
Chatterjee, K., Henzinger, T. A., & Tracol, M. (n.d.). The decidability frontier for probabilistic automata on infinite words. ArXiv.
View | Download (ext.) | arXiv
 

Search

Filter Publications

Display / Sort

Citation Style: APA

Export / Embed

6 Publications

Mark all

[6]
2016 | Journal Article | IST-REx-ID: 1477
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. https://doi.org/10.1016/j.jcss.2016.02.009
View | Files available | DOI | Download (ext.) | arXiv
 
[5]
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. https://doi.org/10.15479/AT:IST-2013-109-v1-1
View | Files available | DOI
 
[4]
2013 | Conference Paper | IST-REx-ID: 2295
Chatterjee, K., Chmelik, M., & Tracol, M. (2013). What is decidable about partially observable Markov decision processes with omega-regular objectives. Presented at the CSL: Computer Science Logic, Torino, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CSL.2013.165
View | Files available | DOI
 
[3]
2012 | Conference Paper | IST-REx-ID: 2957
Chatterjee, K., & Tracol, M. (2012). Decidable problems for probabilistic automata on infinite words. In Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science (p. 6280437). Dubrovnik, Croatia : IEEE. https://doi.org/10.1109/LICS.2012.29
View | Files available | DOI | Download (ext.) | arXiv
 
[2]
2011 | Technical Report | IST-REx-ID: 5384   OA
Chatterjee, K., & Tracol, M. (2011). Decidable problems for probabilistic automata on infinite words. IST Austria. https://doi.org/10.15479/AT:IST-2011-0004
View | Files available | DOI
 
[1]
2011 | Preprint | IST-REx-ID: 3363   OA
Chatterjee, K., Henzinger, T. A., & Tracol, M. (n.d.). The decidability frontier for probabilistic automata on infinite words. ArXiv.
View | Download (ext.) | arXiv
 

Search

Filter Publications

Display / Sort

Citation Style: APA

Export / Embed