Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. Qualitative Analysis of Concurrent Mean-Payoff Games. IST Austria, 2013.https://doi.org/10.15479/AT:IST-2013-126-v1-1 .

Chatterjee, Krishnendu, Martin Chmelik, and Mathieu Tracol. What Is Decidable about Partially Observable Markov Decision Processes with <9-Regular Objectives. IST Austria, 2013.https://doi.org/10.15479/AT:IST-2013-109-v1-1 .

Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. The Complexity of Ergodic Games. IST Austria, 2013.https://doi.org/10.15479/AT:IST-2013-127-v1-1 .

Chatterjee, Krishnendu, Laurent Doyen, Hugo Gimbert, and Youssouf Oualhadj. Perfect-Information Stochastic Mean-Payoff Parity Games. IST Austria, 2013.https://doi.org/10.15479/AT:IST-2013-128-v1-1 .

Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Rupak Majumdar. Edit Distance for Timed Automata. IST Austria, 2013.https://doi.org/10.15479/AT:IST-2013-144-v1-1 .

Chatterjee, Krishnendu, Thomas A Henzinger, Jan Otop, and Andreas Pavlogiannis. “Distributed Synthesis for LTL Fragments.”https://doi.org/10.1109/FMCAD.2013.6679386__In 13th International Conference on Formal Methods in Computer-Aided Design, 18–25. IEEE, 2013.https://doi.org/10.1109/FMCAD.2013.6679386 .

Chatterjee, Krishnendu, Thomas A Henzinger, Jan Otop, and Andreas Pavlogiannis. Distributed Synthesis for LTL Fragments. IST Austria, 2013.https://doi.org/10.15479/AT:IST-2013-130-v1-1 .

Chatterjee, Krishnendu, Laurent Doyen, Sumit Nain, and Moshe Vardi. The Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory Strategies. IST Austria, 2013.https://doi.org/10.15479/AT:IST-2013-141-v1-1 .

Ahmed, Umair, Krishnendu Chatterjee, and Sumit Gulwani. Automatic Generation of Alternative Starting Positions for Traditional Board Games. IST Austria, 2013.https://doi.org/10.15479/AT:IST-2013-146-v1-1 .

Chatterjee, Krishnendu, and Yaron Velner. “Hyperplane Separation Technique for Multidimensional Mean-Payoff Games.”https://doi.org/10.1007/978-3-642-40184-8_35__Lecture Notes in Computer Science. Springer, 2013.https://doi.org/10.1007/978-3-642-40184-8_35 .

Zagorsky, Benjamin, Johannes Reiter, Krishnendu Chatterjee, and Martin Nowak. “Forgiver Triumphs in Alternating Prisoner’s Dilemma .”https://doi.org/10.1371/journal.pone.0080814.s001__Public Library of Science, 2013.https://doi.org/10.1371/journal.pone.0080814.s001 .

Chatterjee, Krishnendu, Siddhesh Chaubal, and Sasha Rubin. “How to Travel between Languages.”https://doi.org/10.1007/978-3-642-37064-9_20__In 7th International Conference on Language and Automata Theory and Applications, 7810:214–25. LNCS. Berlin, Heidelberg: Springer Nature, 2013.https://doi.org/10.1007/978-3-642-37064-9_20 .

Zagorsky, Benjamin, Johannes Reiter, Krishnendu Chatterjee, and Martin Nowak. “Forgiver Triumphs in Alternating Prisoner’s Dilemma .”https://doi.org/10.1371/journal.pone.0080814__PLoS One. Public Library of Science, 2013.https://doi.org/10.1371/journal.pone.0080814 .

Reiter, Johannes, Ivana Boei, Benjamin Allen, Krishnendu Chatterjee, and Martin Nowak. “The Effect of One Additional Driver Mutation on Tumor Progression.”https://doi.org/10.1111/eva.12020__Evolutionary Applications. Wiley-Blackwell, 2013.https://doi.org/10.1111/eva.12020 .

Boei, Ivana, Johannes Reiter, Benjamin Allen, Tibor Antal, Krishnendu Chatterjee, Preya Shah, Yo Moon, et al. “Evolutionary Dynamics of Cancer in Response to Targeted Combination Therapy.”https://doi.org/10.7554/eLife.00747__ELife. eLife Sciences Publications, 2013.https://doi.org/10.7554/eLife.00747 .

Reiter, Johannes, Ivana Boei, Krishnendu Chatterjee, and Martin Nowak. “TTP: Tool for Tumor Progression.”https://doi.org/10.1007/978-3-642-39799-8_6__In Proceedings of 25th Int. Conf. on Computer Aided Verification, 8044:101–6. Lecture Notes in Computer Science. Springer, 2013.https://doi.org/10.1007/978-3-642-39799-8_6 .

Brázdil, Tomás, Krishnendu Chatterjee, Vojtbch Forejt, and Antonín Kudera. “Trading Performance for Stability in Markov Decision Processes.”https://doi.org/10.1109/LICS.2013.39__In 28th Annual ACM/IEEE Symposium, 331–40. IEEE, 2013.https://doi.org/10.1109/LICS.2013.39 .

Chatterjee, Krishnendu, Alexander Kößler, and Ulrich Schmid. “Automated Analysis of Real-Time Scheduling Using Graph Games.”https://doi.org/10.1145/2461328.2461356__In Proceedings of the 16th International Conference on Hybrid Systems: Computation and Control, 163–72. ACM, 2013.https://doi.org/10.1145/2461328.2461356 .

Chatterjee, Krishnendu, Manas Joglekar, and Nisarg Shah. “Average Case Analysis of the Classical Algorithm for Markov Decision Processes with Büchi Objectives,”https://doi.org/10.4230/LIPIcs.FSTTCS.2012.461__18:461–73. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012.https://doi.org/10.4230/LIPIcs.FSTTCS.2012.461 .

Chatterjee, Krishnendu, Mickael Randour, and Jean-François Raskin. “Strategy Synthesis for Multi-Dimensional Quantitative Objectives.”https://doi.org/10.1007/978-3-642-32940-1_10__In CONCUR 2012 - Concurrency Theory, edited by Maciej Koutny and Irek Ulidowski, 7454:115–31. Berlin, Heidelberg: Springer, 2012.https://doi.org/10.1007/978-3-642-32940-1_10 .

Chatterjee, Krishnendu, Damien Zufferey, and Martin Nowak. “Evolutionary Game Dynamics in Populations with Different Learners.”https://doi.org/10.1016/j.jtbi.2012.02.021__Journal of Theoretical Biology. Elsevier, 2012.https://doi.org/10.1016/j.jtbi.2012.02.021 .

Cerny, Pavol, Martin Chmelik, Thomas A Henzinger, and Arjun Radhakrishna. “Interface Simulation Distances.”https://doi.org/10.4204/EPTCS.96.3__In Electronic Proceedings in Theoretical Computer Science, 96:29–42. EPTCS, 2012.https://doi.org/10.4204/EPTCS.96.3 .

Chatterjee, Krishnendu, Thomas A Henzinger, and Vinayak Prabhu. “Finite Automata with Time Delay Blocks.”https://doi.org/10.1145/2380356.2380370__In Roceedings of the Tenth ACM International Conference on Embedded Software, 43–52. ACM, 2012.https://doi.org/10.1145/2380356.2380370 .

Chatterjee, Krishnendu, Martin Chmelik, and Ritankar Majumdar. “Equivalence of Games with Probabilistic Uncertainty and Partial Observation Games,”https://doi.org/10.1007/978-3-642-33386-6_30__7561:385–99. Springer, 2012.https://doi.org/10.1007/978-3-642-33386-6_30 .

Brázdil, Brázdil, Krishnendu Chatterjee, Antonín Kudera, and Petr Novotný. “Efficient Controller Synthesis for Consumption Games with Multiple Resource Types,”https://doi.org/10.1007/978-3-642-31424-7_8__7358:23–38. Springer, 2012.https://doi.org/10.1007/978-3-642-31424-7_8 .

Chatterjee, Krishnendu, and Vishwanath Raman. “Synthesizing Protocols for Digital Contract Signing,”https://doi.org/10.1007/978-3-642-27940-9_11__7148:152–68. Springer, 2012.https://doi.org/10.1007/978-3-642-27940-9_11 .

Chatterjee, Krishnendu, and Laurent Doyen. “Games and Markov Decision Processes with Mean Payoff Parity and Energy Parity Objectives,”https://doi.org/10.1007/978-3-642-25929-6_3__7119:37–46. Springer, 2012.https://doi.org/10.1007/978-3-642-25929-6_3 .

Chatterjee, Krishnendu. “The Complexity of Stochastic Müller Games.”https://doi.org/10.1016/j.ic.2011.11.004__Information and Computation. Elsevier, 2012.https://doi.org/10.1016/j.ic.2011.11.004 .

Chatterjee, Krishnendu, and Ritankar Majumdar. “Discounting and Averaging in Games across Time Scales.”https://doi.org/10.1142/S0129054112400308__International Journal of Foundations of Computer Science. World Scientific Publishing, 2012.https://doi.org/10.1142/S0129054112400308 .

Chatterjee, Krishnendu, and Thomas A Henzinger. “A Survey of Stochastic <9 Regular Games.”https://doi.org/10.1016/j.jcss.2011.05.002__Journal of Computer and System Sciences. Elsevier, 2012.https://doi.org/10.1016/j.jcss.2011.05.002 .

Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “A Survey of Partial-Observation Stochastic Parity Games.”https://doi.org/10.1007/s10703-012-0164-2__Formal Methods in System Design. Springer, 2012.https://doi.org/10.1007/s10703-012-0164-2 .

Chatterjee, Krishnendu, and Laurent Doyen. “Energy Parity Games.”https://doi.org/10.1016/j.tcs.2012.07.038__Theoretical Computer Science. Elsevier, 2012.https://doi.org/10.1016/j.tcs.2012.07.038 .

Kruckman, Alex, Sasha Rubin, John Sheridan, and Ben Zax. “A Myhill Nerode Theorem for Automata with Advice.”https://doi.org/10.4204/EPTCS.96.18__In Proceedings GandALF 2012, 96:238–46. Open Publishing Association, 2012.https://doi.org/10.4204/EPTCS.96.18 .

Rabinovich, Alexander, and Sasha Rubin. “Interpretations in Trees with Countably Many Branches.”https://doi.org/10.1109/LICS.2012.65__IEEE, 2012.https://doi.org/10.1109/LICS.2012.65 .

Chatterjee, Krishnendu, Siddhesh Chaubal, and Pritish Kamath. “Faster Algorithms for Alternating Refinement Relations,”https://doi.org/10.4230/LIPIcs.CSL.2012.167__16:167–82. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012.https://doi.org/10.4230/LIPIcs.CSL.2012.167 .

Chatterjee, Krishnendu, and Monika H Henzinger. “An O(N2) Time Algorithm for Alternating Büchi Games.”https://doi.org/10.1137/1.9781611973099.109__In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, 1386–99. SIAM, 2012.https://doi.org/10.1137/1.9781611973099.109 .

Chatterjee, Krishnendu, and Yaron Velner. “Mean Payoff Pushdown Games.”https://doi.org/10.1109/LICS.2012.30__In Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. IEEE, 2012.https://doi.org/10.1109/LICS.2012.30 .

Chatterjee, Krishnendu, and Yaron Velner. Mean-Payoff Pushdown Games. IST Austria, 2012.https://doi.org/10.15479/AT:IST-2012-0002 .

Chatterjee, Krishnendu, Siddhesh Chaubal, and Pritish Kamath. Faster Algorithms for Alternating Refinement Relations. IST Austria, 2012.https://doi.org/10.15479/AT:IST-2012-0001 .

Chatterjee, Krishnendu, and Laurent Doyen. “Partial-Observation Stochastic Games: How to Win When Belief Fails.”https://doi.org/10.1109/LICS.2012.28__In Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. IEEE, 2012.https://doi.org/10.1109/LICS.2012.28 .

Chatterjee, Krishnendu. “Robustness of Structurally Equivalent Concurrent Parity Games,”https://doi.org/10.1007/978-3-642-28729-9_18__7213:270–85. Springer, 2012.https://doi.org/10.1007/978-3-642-28729-9_18 .

Chatterjee, Krishnendu, and Mathieu Tracol. “Decidable Problems for Probabilistic Automata on Infinite Words.”https://doi.org/10.1109/LICS.2012.29__In Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. IEEE, 2012.https://doi.org/10.1109/LICS.2012.29 .

Chatterjee, Krishnendu, Monika H Henzinger, Sebastian Krinninger, and Danupon Nanongkai. “Polynomial-Time Algorithms for Energy Games with Special Weight Structures.”https://doi.org/10.1007/978-3-642-33090-2_27__In Algorithms – ESA 2012, 7501:301–12. Springer, 2012.https://doi.org/10.1007/978-3-642-33090-2_27 .

Diaz Jr, Luis, Richard Williams, Jian Wu, Isaac Kinde, Joel Hecht, Jordan Berlin, Benjamin Allen, et al. “The Molecular Evolution of Acquired Resistance to Targeted EGFR Blockade in Colorectal Cancers.”https://doi.org/10.1038/nature11219__Nature. Nature Publishing Group, 2012.https://doi.org/10.1038/nature11219 .

Chatterjee, Krishnendu, Johannes Reiter, and Martin Nowak. “Evolutionary Dynamics of Biological Auctions.”https://doi.org/10.1016/j.tpb.2011.11.003__Theoretical Population Biology. Academic Press, 2012.https://doi.org/10.1016/j.tpb.2011.11.003 .

Bloem, Roderick, Krishnendu Chatterjee, Karin Greimel, Thomas A Henzinger, and Barbara Jobstmann. “Specification-Centered Robustness.”https://doi.org/10.1109/SIES.2011.5953660__In 6th IEEE International Symposium on Industrial and Embedded Systems, 176–85. IEEE, 2011.https://doi.org/10.1109/SIES.2011.5953660 .

Chatterjee, Krishnendu, and Ritankar Majumdar. “Minimum Attention Controller Synthesis for Omega Regular Objectives.”https://doi.org/10.1007/978-3-642-24310-3_11__edited by Uli Fahrenberg and Stavros Tripakis, 6919:145–59. Springer, 2011.https://doi.org/10.1007/978-3-642-24310-3_11 .

Chatterjee, Krishnendu, Laurent Doyen, and Rohit Singh. “On Memoryless Quantitative Objectives.”https://doi.org/10.1007/978-3-642-22953-4_13__edited by Olaf Owe, Martin Steffen, and Jan Arne Telle, 6914:148–59. Springer, 2011.https://doi.org/10.1007/978-3-642-22953-4_13 .

Chatterjee, Krishnendu, Luca De Alfaro, and Thomas A Henzinger. “Qualitative Concurrent Parity Games.”https://doi.org/10.1145/1970398.1970404__ACM Transactions on Computational Logic (TOCL). ACM, 2011.https://doi.org/10.1145/1970398.1970404 .

Chatterjee, Krishnendu, and Nathanaël Fijalkow. “A Reduction from Parity Games to Simple Stochastic Games,”https://doi.org/10.4204/EPTCS.54.6__54:74–86. EPTCS, 2011.https://doi.org/10.4204/EPTCS.54.6 .

Chatterjee, Krishnendu, Thomas A Henzinger, Barbara Jobstmann, and Rohit Singh. “QUASY: Quantitative Synthesis Tool,”https://doi.org/10.1007/978-3-642-19835-9_24__6605:267–71. Springer, 2011.https://doi.org/10.1007/978-3-642-19835-9_24 .

Chatterjee, Krishnendu, Thomas A Henzinger, and Mathieu Tracol. “The Decidability Frontier for Probabilistic Automata on Infinite Words.” ArXiv, n.d.

Chatterjee, Krishnendu, Thomas A Henzinger, and Vinayak Prabhu. “Timed Parity Games: Complexity and Robustness.”https://doi.org/10.2168/LMCS-7(4:8)2011__Logical Methods in Computer Science. International Federation of Computational Logic, 2011.https://doi.org/10.2168/LMCS-7(4:8)2011 .

Chatterjee, Krishnendu, Luca De Alfaro, and Roy Pritam. “Magnifying Lens Abstraction for Stochastic Games with Discounted and Long-Run Average Objectives.” ArXiv. ArXiv, 2011.

Chatterjee, Krishnendu, Monika H Henzinger, Manas Joglekar, and Shah Nisarg. “Symbolic Algorithms for Qualitative Analysis of Markov Decision Processes with Büchi Objectives.”https://doi.org/10.1007/978-3-642-22110-1_21__edited by Ganesh Gopalakrishnan and Shaz Qadeer, 6806:260–76. Springer, 2011.https://doi.org/10.1007/978-3-642-22110-1_21 .

Chatterjee, Krishnendu, and Nathanaël Fijalkow. “Finitary Languages,”https://doi.org/10.1007/978-3-642-21254-3_16__6638:216–26. Springer, 2011.https://doi.org/10.1007/978-3-642-21254-3_16 .

Brázdil, Tomás, Václav Broeek, Krishnendu Chatterjee, Vojtbch Forejt, and Antonín Kudera. “Two Views on Multiple Mean Payoff Objectives in Markov Decision Processes.”https://doi.org/10.1109/LICS.2011.10__IEEE, 2011.https://doi.org/10.1109/LICS.2011.10 .

Chatterjee, Krishnendu, and Vinayak Prabhu. “Synthesis of Memory Efficient Real Time Controllers for Safety Objectives,”https://doi.org/10.1145/1967701.1967734__221–30. Springer, 2011.https://doi.org/10.1145/1967701.1967734 .

Chatterjee, Krishnendu. “Graph Games with Reachability Objectives.”https://doi.org/10.1007/978-3-642-24288-5_1__edited by Giorgo Delzanno and Igor Potapov, 6945:1–1. Springer, 2011.https://doi.org/10.1007/978-3-642-24288-5_1 .

Chatterjee, Krishnendu, and Monika H Henzinger. “Faster and Dynamic Algorithms for Maximal End-Component Decomposition and Related Graph Problems in Probabilistic Verification,”https://doi.org/10.1137/1.9781611973082.101__1318–36. SIAM, 2011.https://doi.org/10.1137/1.9781611973082.101 .

Cerny, Pavol, Krishnendu Chatterjee, and Thomas A Henzinger. “The Complexity of Quantitative Information Flow Problems,”https://doi.org/10.1109/CSF.2011.21__205–17. IEEE, 2011.https://doi.org/10.1109/CSF.2011.21 .

Chatterjee, Krishnendu, Thomas A Henzinger, and Florian Horn. “The Complexity of Request-Response Games.”https://doi.org/10.1007/978-3-642-21254-3_17__edited by Adrian-Horia Dediu, Shunsuke Inenaga, and Carlos Martín-Vide, 6638:227–37. Springer, 2011.https://doi.org/10.1007/978-3-642-21254-3_17 .

Chatterjee, Krishnendu, and Monika H Henzinger. An O(N2) Time Algorithm for Alternating Büchi Games. IST Austria, 2011.https://doi.org/10.15479/AT:IST-2011-0009 .

Chatterjee, Krishnendu, and Laurent Doyen. Partial-Observation Stochastic Games: How to Win When Belief Fails. IST Austria, 2011.https://doi.org/10.15479/AT:IST-2011-0007 .

Chatterjee, Krishnendu. Bounded Rationality in Concurrent Parity Games. IST Austria, 2011.https://doi.org/10.15479/AT:IST-2011-0008 .

Chatterjee, Krishnendu. Robustness of Structurally Equivalent Concurrent Parity Games. IST Austria, 2011.https://doi.org/10.15479/AT:IST-2011-0006 .

Chatterjee, Krishnendu. “Bounded Rationality in Concurrent Parity Games.” ArXiv. ArXiv, 2011.

Boker, Udi, Krishnendu Chatterjee, Thomas A Henzinger, and Orna Kupferman. “Temporal Specifications with Accumulative Values.”https://doi.org/10.1109/LICS.2011.33__IEEE, 2011.https://doi.org/10.1109/LICS.2011.33 .

Boker, Udi, Krishnendu Chatterjee, Thomas A Henzinger, and Orna Kupferman. Temporal Specifications with Accumulative Values. IST Austria, 2011.https://doi.org/10.15479/AT:IST-2011-0003 .

Chatterjee, Krishnendu, and Mathieu Tracol. Decidable Problems for Probabilistic Automata on Infinite Words. IST Austria, 2011.https://doi.org/10.15479/AT:IST-2011-0004 .

Cerny, Pavol, Krishnendu Chatterjee, Thomas A Henzinger, Arjun Radhakrishna, and Rohit Singh. “Quantitative Synthesis for Concurrent Programs.”https://doi.org/10.1007/978-3-642-22110-1_20__edited by Ganesh Gopalakrishnan and Shaz Qadeer, 6806:243–59. Springer, 2011.https://doi.org/10.1007/978-3-642-22110-1_20 .

Chatterjee, Krishnendu, and Laurent Doyen. “Energy and Mean-Payoff Parity Markov Decision Processes,”https://doi.org/10.1007/978-3-642-22993-0_21__6907:206–18. Springer, 2011.https://doi.org/10.1007/978-3-642-22993-0_21 .

Chatterjee, Krishnendu, and Laurent Doyen. Energy and Mean-Payoff Parity Markov Decision Processes. IST Austria, 2011.https://doi.org/10.15479/AT:IST-2011-0001 .

Chatterjee, Krishnendu, and Laurent Doyen. “The Complexity of Partial-Observation Parity Games,”https://doi.org/10.1007/978-3-642-16242-8_1__6397:1–14. Springer, 2010.https://doi.org/10.1007/978-3-642-16242-8_1 .

Chatterjee, Krishnendu, Laurent Doyen, Hugo Gimbert, and Thomas A Henzinger. “Randomness for Free,”https://doi.org/10.1007/978-3-642-15155-2_23__6281:246–57. Springer, 2010.https://doi.org/10.1007/978-3-642-15155-2_23 .

Chatterjee, Krishnendu, and Thomas A Henzinger, eds. Formal Modeling and Analysis of Timed Systems. Vol. 6246. Springer, 2010.https://doi.org/10.1007/978-3-642-15297-9 .

Bloem, Roderick, Krishnendu Chatterjee, Karin Greimel, Thomas A Henzinger, and Barbara Jobstmann. “Robustness in the Presence of Liveness.”https://doi.org/10.1007/978-3-642-14295-6_36__edited by Tayssir Touili, Byron Cook, and Paul Jackson, 6174:410–24. Springer, 2010.https://doi.org/10.1007/978-3-642-14295-6_36 .

Chatterjee, Krishnendu, Luca De Alfaro, Ritankar Majumdar, and Vishwanath Raman. “Algorithms for Game Metrics.”https://doi.org/10.2168/LMCS-6(3:13)2010__Logical Methods in Computer Science. International Federation of Computational Logic, 2010.https://doi.org/10.2168/LMCS-6(3:13)2010 .

Chatterjee, Krishnendu, Laurent Doyen, Herbert Edelsbrunner, Thomas A Henzinger, and Philippe Rannou. “Mean-Payoff Automaton Expressions,”https://doi.org/10.1007/978-3-642-15375-4_19__6269:269–83. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010.https://doi.org/10.1007/978-3-642-15375-4_19 .

Chatterjee, Krishnendu, Florian Horn, and Christof Löding. “Obliging Games,”https://doi.org/10.1007/978-3-642-15375-4_20__6269:284–96. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010.https://doi.org/10.1007/978-3-642-15375-4_20 .

Chatterjee, Krishnendu, and Laurent Doyen. “Energy Parity Games,”https://doi.org/10.1007/978-3-642-14162-1_50__6199:599–610. Springer, 2010.https://doi.org/10.1007/978-3-642-14162-1_50 .

Chatterjee, Krishnendu, Laurent Doyen, Thomas A Henzinger, and Jean Raskin. “Generalized Mean-Payoff and Energy Games,”https://doi.org/10.4230/LIPIcs.FSTTCS.2010.505__8:505–16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010.https://doi.org/10.4230/LIPIcs.FSTTCS.2010.505 .

Chatterjee, Krishnendu, Thomas A Henzinger, Barbara Jobstmann, and Rohit Singh. “Measuring and Synthesizing Systems in Probabilistic Environments,”https://doi.org/10.1007/978-3-642-14295-6_34__6174:380–95. Springer, 2010.https://doi.org/10.1007/978-3-642-14295-6_34 .

Chatterjee, Krishnendu, Luca De Alfaro, Vishwanath Raman, and César Sánchez. “Analyzing the Impact of Change in Multi-Threaded Programs.”https://doi.org/10.1007/978-3-642-12029-9_21__edited by David Rosenblum and Gabriele Taenzer, 6013:293–307. Springer, 2010.https://doi.org/10.1007/978-3-642-12029-9_21 .

Berwanger, Dietmar, Krishnendu Chatterjee, Martin De Wulf, Laurent Doyen, and Thomas A Henzinger. “Strategy Construction for Parity Games with Imperfect Information.”https://doi.org/10.1016/j.ic.2009.09.006__Information and Computation. Elsevier, 2010.https://doi.org/10.1016/j.ic.2009.09.006 .

Chatterjee, Krishnendu, Thomas A Henzinger, and Nir Piterman. “Strategy Logic.”https://doi.org/10.1016/j.ic.2009.07.004__Information and Computation. Elsevier, 2010.https://doi.org/10.1016/j.ic.2009.07.004 .

Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “Expressiveness and Closure Properties for Quantitative Languages.”https://doi.org/10.2168/LMCS-6(3:10)2010__Logical Methods in Computer Science. International Federation of Computational Logic, 2010.https://doi.org/10.2168/LMCS-6(3:10)2010 .

Cristau, Julien, Claire David, and Florian Horn. “How Do We Remember the Past in Randomised Strategies? .”https://doi.org/10.4204/EPTCS.25.7__In Proceedings of GandALF 2010, 25:30–39. Open Publishing Association, 2010.https://doi.org/10.4204/EPTCS.25.7 .

Chatterjee, Krishnendu, Pavol Cerny, Thomas A Henzinger, Arjun Radhakrishna, and Rohit Singh. Quantitative Synthesis for Concurrent Programs. IST Austria, 2010.https://doi.org/10.15479/AT:IST-2010-0004 .

Chatterjee, Krishnendu, Thomas A Henzinger, Barbara Jobstmann, and Arjun Radhakrishna. “GIST: A Solver for Probabilistic Games,”https://doi.org/10.1007/978-3-642-14295-6_57__6174:665–69. Springer, 2010.https://doi.org/10.1007/978-3-642-14295-6_57 .

Chatterjee, Krishnendu, and Nathanaël Fijalkow. Topological, Automata-Theoretic and Logical Characterization of Finitary Languages. IST Austria, 2010.https://doi.org/10.15479/AT:IST-2010-0002 .

Chatterjee, Krishnendu, and Thomas A Henzinger. “Probabilistic Automata on Infinite Words: Decidability and Undecidability Results,”https://doi.org/10.1007/978-3-642-15643-4_1__6252:1–16. Springer, 2010.https://doi.org/10.1007/978-3-642-15643-4_1 .

Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “Qualitative Analysis of Partially-Observable Markov Decision Processes,”https://doi.org/10.1007/978-3-642-15155-2_24__6281:258–69. Springer, 2010.https://doi.org/10.1007/978-3-642-15155-2_24 .

Chatterjee, Krishnendu, and Ritankar Majumdar. “Discounting in Games across Time Scales,”https://doi.org/10.4204/EPTCS.25.6__25:22–29. EPTCS, 2010.https://doi.org/10.4204/EPTCS.25.6 .

Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “Probabilistic Weighted Automata,”https://doi.org/10.1007/978-3-642-04081-8_17__5710:244–58. Springer, 2009.https://doi.org/10.1007/978-3-642-04081-8_17 .

Chatterjee, Krishnendu, Thomas A Henzinger, and Florian Horn. “Finitary Winning in Omega-Regular Games.”https://doi.org/10.1145/1614431.1614432__ACM Transactions on Computational Logic (TOCL). ACM, 2009.https://doi.org/10.1145/1614431.1614432 .

Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “Alternating Weighted Automata,”https://doi.org/10.1007/978-3-642-03409-1_2__5699:3–13. Springer, 2009.https://doi.org/10.1007/978-3-642-03409-1_2 .

Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “A Survey of Stochastic Games with Limsup and Liminf Objectives,”https://doi.org/10.1007/978-3-642-02930-1_1__5556:1–15. Springer, 2009.https://doi.org/10.1007/978-3-642-02930-1_1 .

Chatterjee, Krishnendu, Thomas A Henzinger, and Florian Horn. “Stochastic Games with Finitary Objectives,”https://doi.org/10.1007/978-3-642-03816-7_4__5734:34–54. Springer, 2009.https://doi.org/10.1007/978-3-642-03816-7_4 .

Bloem, Roderick, Krishnendu Chatterjee, Thomas A Henzinger, and Barbara Jobstmann. “Better Quality in Synthesis through Quantitative Objectives,”https://doi.org/10.1007/978-3-642-02658-4_14__5643:140–56. Springer, 2009.https://doi.org/10.1007/978-3-642-02658-4_14 .