Robustness of structurally equivalent concurrent parity games
K. Chatterjee, Robustness of Structurally Equivalent Concurrent Parity Games, IST Austria, 2011.

Bounded rationality in concurrent parity games
K. Chatterjee, ArXiv (2011) 1–51.

Temporal specifications with accumulative values
U. Boker, K. Chatterjee, T.A. Henzinger, O. Kupferman, in:, IEEE, 2011.

Temporal specifications with accumulative values
U. Boker, K. Chatterjee, T.A. Henzinger, O. Kupferman, Temporal Specifications with Accumulative Values, IST Austria, 2011.

Decidable problems for probabilistic automata on infinite words
K. Chatterjee, M. Tracol, Decidable Problems for Probabilistic Automata on Infinite Words, IST Austria, 2011.

Quantitative synthesis for concurrent programs
P. Cerny, K. Chatterjee, T.A. Henzinger, A. Radhakrishna, R. Singh, in:, G. Gopalakrishnan, S. Qadeer (Eds.), Springer, 2011, pp. 243–259.

Energy and mean-payoff parity Markov Decision Processes
K. Chatterjee, L. Doyen, in:, Springer, 2011, pp. 206–218.

Energy and mean-payoff parity Markov decision processes
K. Chatterjee, L. Doyen, Energy and Mean-Payoff Parity Markov Decision Processes, IST Austria, 2011.

The complexity of partial-observation parity games
K. Chatterjee, L. Doyen, in:, Springer, 2010, pp. 1–14.

Randomness for free
K. Chatterjee, L. Doyen, H. Gimbert, T.A. Henzinger, in:, Springer, 2010, pp. 246–257.

Formal modeling and analysis of timed systems
K. Chatterjee, T.A. Henzinger, eds., Formal Modeling and Analysis of Timed Systems, Springer, 2010.

Robustness in the presence of liveness
R. Bloem, K. Chatterjee, K. Greimel, T.A. Henzinger, B. Jobstmann, in:, T. Touili, B. Cook, P. Jackson (Eds.), Springer, 2010, pp. 410–424.

Algorithms for game metrics
K. Chatterjee, L. De Alfaro, R. Majumdar, V. Raman, Logical Methods in Computer Science 6 (2010) 1–27.

Mean-payoff automaton expressions
K. Chatterjee, L. Doyen, H. Edelsbrunner, T.A. Henzinger, P. Rannou, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 269–283.

Obliging games
K. Chatterjee, F. Horn, C. Löding, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 284–296.

Energy parity games
K. Chatterjee, L. Doyen, in:, Springer, 2010, pp. 599–610.

Generalized mean-payoff and energy games
K. Chatterjee, L. Doyen, T.A. Henzinger, J. Raskin, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 505–516.

Measuring and synthesizing systems in probabilistic environments
K. Chatterjee, T.A. Henzinger, B. Jobstmann, R. Singh, in:, Springer, 2010, pp. 380–395.

Analyzing the impact of change in multi-threaded programs
K. Chatterjee, L. De Alfaro, V. Raman, C. Sánchez, in:, D. Rosenblum, G. Taenzer (Eds.), Springer, 2010, pp. 293–307.

Strategy construction for parity games with imperfect information
D. Berwanger, K. Chatterjee, M. De Wulf, L. Doyen, T.A. Henzinger, Information and Computation 208 (2010) 1206–1220.

Strategy logic
K. Chatterjee, T.A. Henzinger, N. Piterman, Information and Computation 208 (2010) 677–693.

Expressiveness and closure properties for quantitative languages
K. Chatterjee, L. Doyen, T.A. Henzinger, Logical Methods in Computer Science 6 (2010) 1–23.

How do we remember the past in randomised strategies? 
J. Cristau, C. David, F. Horn, in:, Proceedings of GandALF 2010, Open Publishing Association, 2010, pp. 30–39.

Quantitative synthesis for concurrent programs
K. Chatterjee, P. Cerny, T.A. Henzinger, A. Radhakrishna, R. Singh, Quantitative Synthesis for Concurrent Programs, IST Austria, 2010.

GIST: A solver for probabilistic games
K. Chatterjee, T.A. Henzinger, B. Jobstmann, A. Radhakrishna, in:, Springer, 2010, pp. 665–669.

Topological, automata-theoretic and logical characterization of finitary languages
K. Chatterjee, N. Fijalkow, Topological, Automata-Theoretic and Logical Characterization of Finitary Languages, IST Austria, 2010.

Probabilistic Automata on infinite words: decidability and undecidability results
K. Chatterjee, T.A. Henzinger, in:, Springer, 2010, pp. 1–16.

Qualitative analysis of partially-observable Markov Decision Processes
K. Chatterjee, L. Doyen, T.A. Henzinger, in:, Springer, 2010, pp. 258–269.

Discounting in games across time scales
K. Chatterjee, R. Majumdar, in:, EPTCS, 2010, pp. 22–29.

Probabilistic weighted automata
K. Chatterjee, L. Doyen, T.A. Henzinger, in:, Springer, 2009, pp. 244–258.

Finitary winning in omega-regular games
K. Chatterjee, T.A. Henzinger, F. Horn, ACM Transactions on Computational Logic (TOCL) 11 (2009).

Alternating weighted automata
K. Chatterjee, L. Doyen, T.A. Henzinger, in:, Springer, 2009, pp. 3–13.

A survey of stochastic games with limsup and liminf objectives
K. Chatterjee, L. Doyen, T.A. Henzinger, in:, Springer, 2009, pp. 1–15.

Stochastic games with finitary objectives
K. Chatterjee, T.A. Henzinger, F. Horn, in:, Springer, 2009, pp. 34–54.

Better quality in synthesis through quantitative objectives
R. Bloem, K. Chatterjee, T.A. Henzinger, B. Jobstmann, in:, Springer, 2009, pp. 140–156.

Gist: A solver for probabilistic games
K. Chatterjee, T.A. Henzinger, B. Jobstmann, A. Radhakrishna, Gist: A Solver for Probabilistic Games, IST Austria, 2009.

Improved lower bounds for request-response and finitary Streett games
K. Chatterjee, T.A. Henzinger, F. Horn, Improved Lower Bounds for Request-Response and Finitary Streett Games, IST Austria, 2009.

Probabilistic automata on infinite words: Decidability and undecidability results
K. Chatterjee, Probabilistic Automata on Infinite Words: Decidability and Undecidability Results, IST Austria, 2009.

Qualitative analysis of partially-observable Markov decision processes
K. Chatterjee, L. Doyen, T.A. Henzinger, Qualitative Analysis of Partially-Observable Markov Decision Processes, IST Austria, 2009.