Chatterjee, K., Chmelik, M., &; Tracol, M. (2016). What is decidable about partially observable Markov decision processes with <9-regular objectives. Journal of Computer and System Sciences. Elsevier.https://doi.org/10.1016/j.jcss.2016.02.009 

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 

Chatterjee, K., Chmelik, M., &; Tracol, M. (2013). What is decidable about partially observable Markov decision processes with <9-regular objectives. IST Austria.https://doi.org/10.15479/AT:IST-2013-109-v1-1 

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. Dubrovnik, Croatia : IEEE.https://doi.org/10.1109/LICS.2012.29 

Chatterjee, K., Henzinger, T. A., &; Tracol, M. (n.d.). The decidability frontier for probabilistic automata on infinite words. ArXiv.

Chatterjee, K., &; Tracol, M. (2011). Decidable problems for probabilistic automata on infinite words. IST Austria.https://doi.org/10.15479/AT:IST-2011-0004