Boker, U., Chatterjee, K., Henzinger, T. A., & Kupferman, O. (2011). Temporal specifications with accumulative values. Presented at the LICS: Logic in Computer Science, Toronto, Canada: IEEE. https://doi.org/10.1109/LICS.2011.33
Chatterjee, K., & Doyen, L. (2011). Energy and mean-payoff parity Markov Decision Processes (Vol. 6907, pp. 206–218). Presented at the MFCS: Mathematical Foundations of Computer Science, Warsaw, Poland: Springer. https://doi.org/10.1007/978-3-642-22993-0_21
View | Files available | DOI | Download Preprint (ext.) | arXiv
Boker, U., Chatterjee, K., Henzinger, T. A., & Kupferman, O. (2011). Temporal specifications with accumulative values. IST Austria. https://doi.org/10.15479/AT:IST-2011-0003
Chatterjee, K., & Tracol, M. (2011). Decidable problems for probabilistic automata on infinite words. IST Austria. https://doi.org/10.15479/AT:IST-2011-0004
Cerny, P., Chatterjee, K., Henzinger, T. A., Radhakrishna, A., & Singh, R. (2011). Quantitative synthesis for concurrent programs. In G. Gopalakrishnan & S. Qadeer (Eds.) (Vol. 6806, pp. 243–259). Presented at the CAV: Computer Aided Verification, Snowbird, USA: Springer. https://doi.org/10.1007/978-3-642-22110-1_20
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
Chatterjee, K., & Doyen, L. (2010). Energy parity games (Vol. 6199, pp. 599–610). Presented at the ICALP: Automata, Languages and Programming, 37th International Colloquium, Bordeaux, France: Springer. https://doi.org/10.1007/978-3-642-14162-1_50
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
View | Files available | DOI | arXiv
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
2010 | Conference Paper | IST-REx-ID: 3854
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
Chatterjee, K., Doyen, L., Gimbert, H., & Henzinger, T. A. (2010). Randomness for free (Vol. 6281, pp. 246–257). Presented at the MFCS: Mathematical Foundations of Computer Science, Brno, Czech Republic: Springer. https://doi.org/10.1007/978-3-642-15155-2_23
View | Files available | DOI | Download Preprint (ext.)
Chatterjee, K., & Doyen, L. (2010). The complexity of partial-observation parity games (Vol. 6397, pp. 1–14). Presented at the LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, Yogyakarta, Indonesia: Springer. https://doi.org/10.1007/978-3-642-16242-8_1
2010 | Conference (Editor) | IST-REx-ID: 3859
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
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
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
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
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
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
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
Chatterjee, K., Henzinger, T. A., & Piterman, N. (2010). Strategy logic. Information and Computation. Elsevier. https://doi.org/10.1016/j.ic.2009.07.004
2010 | Conference Paper | IST-REx-ID: 489 |
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
View | DOI | Download Published Version (ext.)
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
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
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
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
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
Chatterjee, K., Doyen, L., & Henzinger, T. A. (2009). Alternating weighted automata (Vol. 5699, pp. 3–13). Presented at the FCT: Fundamentals of Computation Theory, Wroclaw, Poland: Springer. https://doi.org/10.1007/978-3-642-03409-1_2
Chatterjee, K., Henzinger, T. A., & Horn, F. (2009). Stochastic games with finitary objectives (Vol. 5734, pp. 34–54). Presented at the MFCS: Mathematical Foundations of Computer Science, High Tatras, Slovakia: Springer. https://doi.org/10.1007/978-3-642-03816-7_4
Chatterjee, K., Doyen, L., & Henzinger, T. A. (2009). A survey of stochastic games with limsup and liminf objectives (Vol. 5556, pp. 1–15). Presented at the ICALP: Automata, Languages and Programming, Rhodos, Greece: Springer. https://doi.org/10.1007/978-3-642-02930-1_1
Chatterjee, K., Doyen, L., & Henzinger, T. A. (2009). Qualitative analysis of partially-observable Markov decision processes. IST Austria. https://doi.org/10.15479/AT:IST-2009-0001
Chatterjee, K. (2009). Probabilistic automata on infinite words: Decidability and undecidability results. IST Austria. https://doi.org/10.15479/AT:IST-2009-0004
department=KrCh