Chatterjee K, Henzinger TA, Piterman N. 2010. Strategy logic. Information and Computation. 208(6), 677–693.
LibreCat: https://research-explorer.ista.ac.at/record/3861
DOI: 10.1016/j.ic.2009.07.004

Chatterjee K, Doyen L, Henzinger TA. 2010. Expressiveness and closure properties for quantitative languages. Logical Methods in Computer Science. 6(3), 1–23.
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? . Proceedings of GandALF 2010. GandALF: Games, Automata, Logic, and Formal Verification, EPTCS, vol. 25, 30–39.
LibreCat: https://research-explorer.ista.ac.at/record/489
DOI: 10.4204/EPTCS.25.7

Chatterjee K, Cerny P, Henzinger TA, Radhakrishna A, Singh R. 2010. Quantitative synthesis for concurrent programs, IST Austria, 17p.
LibreCat: https://research-explorer.ista.ac.at/record/5388
DOI: 10.15479/AT:IST-2010-0004

Chatterjee K, Henzinger TA, Jobstmann B, Radhakrishna A. 2010. GIST: A solver for probabilistic games. CAV: Computer Aided Verification, LNCS, vol. 6174, 665–669.
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, 21p.
LibreCat: https://research-explorer.ista.ac.at/record/5390
DOI: 10.15479/AT:IST-2010-0002

Chatterjee K, Henzinger TA. 2010. Probabilistic Automata on infinite words: decidability and undecidability results. ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 6252, 1–16.
LibreCat: https://research-explorer.ista.ac.at/record/3857
DOI: 10.1007/978-3-642-15643-4_1

Chatterjee K, Doyen L, Henzinger TA. 2010. Qualitative analysis of partially-observable Markov Decision Processes. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 6281, 258–269.
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. GandALF: Games, Automata, Logic, and Formal Verification, EPTCS, vol. 25, 22–29.
LibreCat: https://research-explorer.ista.ac.at/record/3852
DOI: 10.4204/EPTCS.25.6
arXiv: 1006.1403

Chatterjee K, Doyen L, Henzinger TA. 2009. Probabilistic weighted automata. CONCUR: Concurrency Theory, LNCS, vol. 5710, 244–258.
LibreCat: https://research-explorer.ista.ac.at/record/3871
DOI: 10.1007/978-3-642-04081-8_17

Chatterjee K, Henzinger TA, Horn F. 2009. Finitary winning in omega-regular games. ACM Transactions on Computational Logic (TOCL). 11(1), 1.
LibreCat: https://research-explorer.ista.ac.at/record/3870
DOI: 10.1145/1614431.1614432

Chatterjee K, Doyen L, Henzinger TA. 2009. Alternating weighted automata. FCT: Fundamentals of Computation Theory, LNCS, vol. 5699, 3–13.
LibreCat: https://research-explorer.ista.ac.at/record/4542
DOI: 10.1007/978-3-642-03409-1_2

Chatterjee K, Doyen L, Henzinger TA. 2009. A survey of stochastic games with limsup and liminf objectives. ICALP: Automata, Languages and Programming, LNCS, vol. 5556, 1–15.
LibreCat: https://research-explorer.ista.ac.at/record/4545
DOI: 10.1007/978-3-642-02930-1_1

Chatterjee K, Henzinger TA, Horn F. 2009. Stochastic games with finitary objectives. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 5734, 34–54.
LibreCat: https://research-explorer.ista.ac.at/record/4543
DOI: 10.1007/978-3-642-03816-7_4

Bloem R, Chatterjee K, Henzinger TA, Jobstmann B. 2009. Better quality in synthesis through quantitative objectives. CAV: Computer Aided Verification, LNCS, vol. 5643, 140–156.
LibreCat: https://research-explorer.ista.ac.at/record/4569
DOI: 10.1007/978-3-642-02658-4_14
arXiv: 0904.2638

Chatterjee K, Henzinger TA, Jobstmann B, Radhakrishna A. 2009. Gist: A solver for probabilistic games, IST Austria, 12p.
LibreCat: https://research-explorer.ista.ac.at/record/5393
DOI: 10.15479/AT:IST-2009-0003

Chatterjee K, Henzinger TA, Horn F. 2009. Improved lower bounds for request-response and finitary Streett games, IST Austria, 11p.
LibreCat: https://research-explorer.ista.ac.at/record/5394
DOI: 10.15479/AT:IST-2009-0002

Chatterjee K. 2009. Probabilistic automata on infinite words: Decidability and undecidability results, IST Austria, 17p.
LibreCat: https://research-explorer.ista.ac.at/record/5392
DOI: 10.15479/AT:IST-2009-0004

Chatterjee K, Doyen L, Henzinger TA. 2009. Qualitative analysis of partially-observable Markov decision processes, IST Austria, 20p.
LibreCat: https://research-explorer.ista.ac.at/record/5395
DOI: 10.15479/AT:IST-2009-0001