Chatterjee, K., &; Henzinger, T. A. (Eds.). (2010). Formal modeling and analysis of timed systems (Vol. 6246). Presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Klosterneuburg, Austria: Springer.https://doi.org/10.1007/978-3-642-15297-9 
LibreCat: https://research-explorer.ista.ac.at/record/3859
DOI: 10.1007/978-3-642-15297-9

Bloem, R., Chatterjee, K., Greimel, K., Henzinger, T. A., &; Jobstmann, B. (2010). Robustness in the presence of liveness. In T. Touili, B. Cook, &; P. Jackson (Eds.) (Vol. 6174, pp. 410–424). Presented at the CAV: Computer Aided Verification, Edinburgh, UK: Springer.https://doi.org/10.1007/978-3-642-14295-6_36 
LibreCat: https://research-explorer.ista.ac.at/record/3866
DOI: 10.1007/978-3-642-14295-6_36

Chatterjee, K., De Alfaro, L., Majumdar, R., &; Raman, V. (2010). Algorithms for game metrics. Logical Methods in Computer Science. International Federation of Computational Logic.https://doi.org/10.2168/LMCS-6(3:13)2010 
LibreCat: https://research-explorer.ista.ac.at/record/3868
DOI: 10.2168/LMCS-6(3:13)2010

Chatterjee, K., Doyen, L., Edelsbrunner, H., Henzinger, T. A., &; Rannou, P. (2010). Mean-payoff automaton expressions (Vol. 6269, pp. 269–283). Presented at the CONCUR: Concurrency Theory, Paris, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.1007/978-3-642-15375-4_19 
LibreCat: https://research-explorer.ista.ac.at/record/3853
DOI: 10.1007/978-3-642-15375-4_19

Chatterjee, K., Horn, F., &; Löding, C. (2010). Obliging games (Vol. 6269, pp. 284–296). Presented at the CONCUR: Concurrency Theory, Paris, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.1007/978-3-642-15375-4_20 
LibreCat: https://research-explorer.ista.ac.at/record/3854
DOI: 10.1007/978-3-642-15375-4_20

Chatterjee, K., &; Doyen, L. (2010). Energy parity games (Vol. 6199, pp. 599–610). Presented at thehttps://doi.org/10.1007/978-3-642-14162-1_50__ICALP: Automata, Languages and Programming, 37th International Colloquium, Bordeaux, France: Springer.https://doi.org/10.1007/978-3-642-14162-1_50 
LibreCat: https://research-explorer.ista.ac.at/record/3851
DOI: 10.1007/978-3-642-14162-1_50
arXiv: 1001.5183

Chatterjee, K., Doyen, L., Henzinger, T. A., &; Raskin, J. (2010). Generalized mean-payoff and energy games (Vol. 8, pp. 505–516). Presented at the FSTTCS: Foundations of Software Technology and Theoretical Computer Science, Chennai, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.FSTTCS.2010.505 
LibreCat: https://research-explorer.ista.ac.at/record/3860
DOI: 10.4230/LIPIcs.FSTTCS.2010.505

Chatterjee, K., Henzinger, T. A., Jobstmann, B., &; Singh, R. (2010). Measuring and synthesizing systems in probabilistic environments (Vol. 6174, pp. 380–395). Presented at the CAV: Computer Aided Verification, Edinburgh, United Kingdom: Springer.https://doi.org/10.1007/978-3-642-14295-6_34 
LibreCat: https://research-explorer.ista.ac.at/record/3864
DOI: 10.1007/978-3-642-14295-6_34

Chatterjee, K., De Alfaro, L., Raman, V., &; Sánchez, C. (2010). Analyzing the impact of change in multi-threaded programs. In D. Rosenblum &; G. Taenzer (Eds.) (Vol. 6013, pp. 293–307). Presented at the FASE: Fundamental Approaches To Software Engineering, Paphos, Cyprus: Springer.https://doi.org/10.1007/978-3-642-12029-9_21 
LibreCat: https://research-explorer.ista.ac.at/record/3865
DOI: 10.1007/978-3-642-12029-9_21

Berwanger, D., Chatterjee, K., De Wulf, M., Doyen, L., &; Henzinger, T. A. (2010). Strategy construction for parity games with imperfect information. Information and Computation. Elsevier.https://doi.org/10.1016/j.ic.2009.09.006 
LibreCat: https://research-explorer.ista.ac.at/record/3863
DOI: 10.1016/j.ic.2009.09.006

Chatterjee, K., Henzinger, T. A., &; Piterman, N. (2010). Strategy logic. Information and Computation. Elsevier.https://doi.org/10.1016/j.ic.2009.07.004 
LibreCat: https://research-explorer.ista.ac.at/record/3861
DOI: 10.1016/j.ic.2009.07.004

Chatterjee, K., Doyen, L., &; Henzinger, T. A. (2010). Expressiveness and closure properties for quantitative languages. Logical Methods in Computer Science. International Federation of Computational Logic.https://doi.org/10.2168/LMCS-6(3:10)2010 
LibreCat: https://research-explorer.ista.ac.at/record/3867
DOI: 10.2168/LMCS-6(3:10)2010

Cristau, J., David, C., &; Horn, F. (2010). How do we remember the past in randomised strategies? . In Proceedings of GandALF 2010 (Vol. 25, pp. 30–39). Minori, Amalfi Coast, Italy: Open Publishing Association.https://doi.org/10.4204/EPTCS.25.7 
LibreCat: https://research-explorer.ista.ac.at/record/489
DOI: 10.4204/EPTCS.25.7

Chatterjee, K., Cerny, P., Henzinger, T. A., Radhakrishna, A., &; Singh, R. (2010). Quantitative synthesis for concurrent programs. IST Austria.https://doi.org/10.15479/AT:IST-2010-0004 
LibreCat: https://research-explorer.ista.ac.at/record/5388
DOI: 10.15479/AT:IST-2010-0004

Chatterjee, K., Henzinger, T. A., Jobstmann, B., &; Radhakrishna, A. (2010). GIST: A solver for probabilistic games (Vol. 6174, pp. 665–669). Presented at the CAV: Computer Aided Verification, Edinburgh, UK: Springer.https://doi.org/10.1007/978-3-642-14295-6_57 
LibreCat: https://research-explorer.ista.ac.at/record/4388
DOI: 10.1007/978-3-642-14295-6_57
arXiv: 1004.2367

Chatterjee, K., &; Fijalkow, N. (2010). Topological, automata-theoretic and logical characterization of finitary languages. IST Austria.https://doi.org/10.15479/AT:IST-2010-0002 
LibreCat: https://research-explorer.ista.ac.at/record/5390
DOI: 10.15479/AT:IST-2010-0002

Chatterjee, K., &; Henzinger, T. A. (2010). Probabilistic Automata on infinite words: decidability and undecidability results (Vol. 6252, pp. 1–16). Presented at the ATVA: Automated Technology for Verification and Analysis, Singapore, Singapore: Springer.https://doi.org/10.1007/978-3-642-15643-4_1 
LibreCat: https://research-explorer.ista.ac.at/record/3857
DOI: 10.1007/978-3-642-15643-4_1

Chatterjee, K., Doyen, L., &; Henzinger, T. A. (2010). Qualitative analysis of partially-observable Markov Decision Processes (Vol. 6281, pp. 258–269). Presented at the MFCS: Mathematical Foundations of Computer Science, Brno, Czech Republic: Springer.https://doi.org/10.1007/978-3-642-15155-2_24 
LibreCat: https://research-explorer.ista.ac.at/record/3855
DOI: 10.1007/978-3-642-15155-2_24

Chatterjee, K., &; Majumdar, R. (2010). Discounting in games across time scales (Vol. 25, pp. 22–29). Presented at the GandALF: Games, Automata, Logic, and Formal Verification, Minori, Italy: EPTCS.https://doi.org/10.4204/EPTCS.25.6 
LibreCat: https://research-explorer.ista.ac.at/record/3852
DOI: 10.4204/EPTCS.25.6
arXiv: 1006.1403

Chatterjee, K., Doyen, L., &; Henzinger, T. A. (2009). Probabilistic weighted automata (Vol. 5710, pp. 244–258). Presented at the CONCUR: Concurrency Theory, Bologna, Italy: Springer.https://doi.org/10.1007/978-3-642-04081-8_17 
LibreCat: https://research-explorer.ista.ac.at/record/3871
DOI: 10.1007/978-3-642-04081-8_17