1. Chatterjee, K.: Stochastic ω-Regular Games. PhD thesis, UC Berkeley (2007)
2. Lecture Notes in Computer Science;K. Chatterjee,2008
3. Chatterjee, K., Henzinger, T.A., Jobstmann, B., Radhakrishna, A.: Gist: A solver for probabilistic games. CoRR, abs/1004.2367 (2010)
4. Chatterjee, K., Jurdziński, M., Henzinger, T.A.: Quantitative stochastic parity games. In: Ian Munro, J. (ed.) Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, New Orleans, Louisiana, USA, January 11-14. SIAM, Philadelphia (2004)
5. Gurevich, Y., Harrington, L.: Trees, automata, and games. In: STOC ’82: Proceedings of the fourteenth annual ACM symposium on Theory of computing, San Francisco, California, United States, pp. 60–65. ACM Press, New York (1982) ISBN: 0-89791-070-2,
http://doi.acm.org/10.1145/800070.802177