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. 82(5), 878–911.

Chatterjee K, Chmelik M, Tracol M. 2013. What is decidable about partially observable Markov decision processes with omega-regular objectives. 23, 165–180.

Chatterjee K, Chmelik M, Tracol M. 2013. What is decidable about partially observable Markov decision processes with <9-regular objectives, IST Austria, 41p.

Chatterjee K, Tracol M. 2012. Decidable problems for probabilistic automata on infinite words. Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Logic in Computer Science, 6280437.

Chatterjee K, Henzinger TA, Tracol M. The decidability frontier for probabilistic automata on infinite words.

Chatterjee K, Tracol M. 2011. Decidable problems for probabilistic automata on infinite words, IST Austria, 30p.