K. Chatterjee, M. Chmelik, and M. Tracol, “What is decidable about partially observable Markov decision processes with <9-regular objectives,” Journal of Computer and System Sciences, vol. 82, no. 5. Elsevier, pp. 878–911, 2016.
LibreCat: https://research-explorer.ista.ac.at/record/1477
DOI: 10.1016/j.jcss.2016.02.009
arXiv: 1309.2802

K. Chatterjee, M. Chmelik, and M. Tracol, “What is decidable about partially observable Markov decision processes with omega-regular objectives,” vol. 23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp. 165–180, 2013.
LibreCat: https://research-explorer.ista.ac.at/record/2295
DOI: 10.4230/LIPIcs.CSL.2013.165

K. Chatterjee, M. Chmelik, and M. Tracol, What is decidable about partially observable Markov decision processes with <9-regular objectives. IST Austria, 2013.
LibreCat: https://research-explorer.ista.ac.at/record/5400
DOI: 10.15479/AT:IST-2013-109-v1-1

K. Chatterjee and M. Tracol, “Decidable problems for probabilistic automata on infinite words,” in Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, Dubrovnik, Croatia , 2012.
LibreCat: https://research-explorer.ista.ac.at/record/2957
DOI: 10.1109/LICS.2012.29
arXiv: 1107.2091

K. Chatterjee, T. A. Henzinger, and M. Tracol, “The decidability frontier for probabilistic automata on infinite words.” ArXiv.
LibreCat: https://research-explorer.ista.ac.at/record/3363
arXiv: 1104.0127

K. Chatterjee and M. Tracol, Decidable problems for probabilistic automata on infinite words. IST Austria, 2011.
LibreCat: https://research-explorer.ista.ac.at/record/5384
DOI: 10.15479/AT:IST-2011-0004