Hermanns, Holger, Jan Krdál, and Jan Kretinsky. “Probabilistic Bisimulation: Naturally on Distributions.”https://doi.org/10.1007/978-3-662-44584-6_18__In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), edited by Paolo Baldan and Daniele Gorla, 8704:249–65. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014.https://doi.org/10.1007/978-3-662-44584-6_18 .

Aminof, Benjamin, Tomer Kotek, Sacha Rubin, Francesco Spegni, and Helmut Veith. “Parameterized Model Checking of Rendezvous Systems.”https://doi.org/10.1007/978-3-662-44584-6_9__In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), edited by Paolo Baldan and Daniele Gorla, 8704:109–24. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014.https://doi.org/10.1007/978-3-662-44584-6_9 .

Bloem, Roderick, Krishnendu Chatterjee, Karin Greimel, Thomas A Henzinger, Georg Hofferek, Barbara Jobstmann, Bettina Könighofer, and Robert Könighofer. “Synthesizing Robust Systems.”https://doi.org/10.1007/s00236-013-0191-5__Acta Informatica. Springer, 2014.https://doi.org/10.1007/s00236-013-0191-5 .

Esparza, Javier, and Jan Kretinsky. “From LTL to Deterministic Automata: A Safraless Compositional Approach,”https://doi.org/10.1007/978-3-319-08867-9_13__8559:192–208. Springer, 2014.https://doi.org/10.1007/978-3-319-08867-9_13 .

Brázdil, Tomás, Václav Broeek, Krishnendu Chatterjee, Vojtbch Forejt, and Antonín Kudera. “Markov Decision Processes with Multiple Long-Run Average Objectives.”https://doi.org/10.2168/LMCS-10(1:13)2014__Logical Methods in Computer Science. International Federation of Computational Logic, 2014.https://doi.org/10.2168/LMCS-10(1:13)2014 .

Grinshpun, Andrey, Pakawat Phalitnonkiat, Sasha Rubin, and Andrei Tarfulea. “Alternating Traps in Muller and Parity Games.”https://doi.org/10.1016/j.tcs.2013.11.032__Theoretical Computer Science. Elsevier, 2014.https://doi.org/10.1016/j.tcs.2013.11.032 .

Chatterjee, Krishnendu, Mickael Randour, and Jean Raskin. “Strategy Synthesis for Multi-Dimensional Quantitative Objectives.”https://doi.org/10.1007/s00236-013-0182-6__Acta Informatica. Springer, 2014.https://doi.org/10.1007/s00236-013-0182-6 .

Cerny, Pavol, Martin Chmelik, Thomas A Henzinger, and Arjun Radhakrishna. “Interface Simulation Distances.”https://doi.org/10.1016/j.tcs.2014.08.019__Theoretical Computer Science. Elsevier, 2014.https://doi.org/10.1016/j.tcs.2014.08.019 .

Chatterjee, Krishnendu, and Monika H Henzinger. “Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition.”https://doi.org/10.1145/2597631__Journal of the ACM. ACM, 2014.https://doi.org/10.1145/2597631 .

Chatterjee, Krishnendu. “Qualitative Concurrent Parity Games: Bounded Rationality.”https://doi.org/10.1007/978-3-662-44584-6_37__In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), edited by Paolo Baldan and Daniele Gorla, 8704:544–59. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014.https://doi.org/10.1007/978-3-662-44584-6_37 .

Aminof, Benjamin, and Sasha Rubin. “First Cycle Games.”https://doi.org/10.4204/EPTCS.146.11__In Electronic Proceedings in Theoretical Computer Science, EPTCS, 146:83–90. Open Publishing Association, 2014.https://doi.org/10.4204/EPTCS.146.11 .

Chatterjee, Krishnendu. “Partial-Observation Stochastic Reachability and Parity Games,”https://doi.org/10.1007/978-3-662-44522-8_1__8634:1–4. Springer, 2014.https://doi.org/10.1007/978-3-662-44522-8_1 .

Chatterjee, Krishnendu, and Laurent Doyen. “Partial-Observation Stochastic Games: How to Win When Belief Fails.”https://doi.org/10.1145/2579821__ACM Transactions on Computational Logic (TOCL). ACM, 2014.https://doi.org/10.1145/2579821 .

Boker, Udi, Krishnendu Chatterjee, Thomas A Henzinger, and Orna Kupferman. “Temporal Specifications with Accumulative Values.”https://doi.org/10.1145/2629686__ACM Transactions on Computational Logic (TOCL). ACM, 2014.https://doi.org/10.1145/2629686 .

Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. “The Complexity of Ergodic Mean Payoff Games,”https://doi.org/10.1007/978-3-662-43951-7_11__8573:122–33. Springer, 2014.https://doi.org/10.1007/978-3-662-43951-7_11 .

Chatterjee, Krishnendu, Laurent Doyen, Sumit Nain, and Moshe Vardi. “The Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory Strategies,”https://doi.org/10.1007/978-3-642-54830-7_16__8412:242–57. Springer, 2014.https://doi.org/10.1007/978-3-642-54830-7_16 .

Chatterjee, Krishnendu, Laurent Doyen, Hugo Gimbert, and Youssouf Oualhadj. “Perfect-Information Stochastic Mean-Payoff Parity Games,”https://doi.org/10.1007/978-3-642-54830-7_14__8412:210–25. Springer, 2014.https://doi.org/10.1007/978-3-642-54830-7_14 .

Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Ritankar Majumdar. “Edit Distance for Timed Automata,”https://doi.org/10.1145/2562059.2562141__303–12. Springer, 2014.https://doi.org/10.1145/2562059.2562141 .

Chatterjee, Krishnendu, Przemyslaw Daca, and Martin Chmelik. CEGAR for Qualitative Analysis of Probabilistic Systems. IST Austria, 2014.https://doi.org/10.15479/AT:IST-2014-153-v2-2 .

Chatterjee, Krishnendu, Przemyslaw Daca, and Martin Chmelik. CEGAR for Qualitative Analysis of Probabilistic Systems. IST Austria, 2014.https://doi.org/10.15479/AT:IST-2014-153-v3-1 .

Chatterjee, Krishnendu, Przemyslaw Daca, and Martin Chmelik. CEGAR for Qualitative Analysis of Probabilistic Systems. IST Austria, 2014.https://doi.org/10.15479/AT:IST-2014-153-v1-1 .

Chatterjee, Krishnendu, and Laurent Doyen. “Games with a Weak Adversary.”https://doi.org/10.1007/978-3-662-43951-7_10__In Lecture Notes in Computer Science, 8573:110–21. Springer, 2014.https://doi.org/10.1007/978-3-662-43951-7_10 .

Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. Improved Algorithms for Reachability and Shortest Path on Low Tree-Width Graphs. IST Austria, 2014.https://doi.org/10.15479/AT:IST-2014-187-v1-1 .

Chatterjee, Krishnendu, and Laurent Doyen. Games with a Weak Adversary. IST Austria, 2014.https://doi.org/10.15479/AT:IST-2014-176-v1-1 .

Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. The Value 1 Problem for Concurrent Mean-Payoff Games. IST Austria, 2014.https://doi.org/10.15479/AT:IST-2014-191-v1-1 .

Chatterjee, Krishnendu, Martin Chmelik, Raghav Gupta, and Ayush Kanodia. Qualitative Analysis of POMDPs with Temporal Logic Specifications for Robotics Applications. IST Austria, 2014.https://doi.org/10.15479/AT:IST-2014-305-v1-1 .

Chatterjee, Krishnendu, Martin Chmelik, Raghav Gupta, and Ayush Kanodia. Qualitative Analysis of POMDPs with Temporal Logic Specifications for Robotics Applications. IST Austria, 2014.https://doi.org/10.15479/AT:IST-2014-305-v2-1 .

Chatterjee, Krishnendu, Alexander Kössler, Andreas Pavlogiannis, and Ulrich Schmid. A Framework for Automated Competitive Analysis of On-Line Scheduling of Firm-Deadline Tasks. IST Austria, 2014.https://doi.org/10.15479/AT:IST-2014-300-v1-1 .

Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. Optimal Tree-Decomposition Balancing and Reachability on Low Treewidth Graphs. IST Austria, 2014.https://doi.org/10.15479/AT:IST-2014-314-v1-1 .

Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. Nested Weighted Automata. IST Austria, 2014.https://doi.org/10.15479/AT:IST-2014-170-v1-1 .

Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Martin Nowak. The Complexity of Evolution on Graphs. IST Austria, 2014.https://doi.org/10.15479/AT:IST-2014-190-v2-2 .

Chatterjee, Krishnendu, Laurent Doyen, Emmanuel Filiot, and Jean-François Raskin. “Doomsday Equilibria for Omega-Regular Games.”https://doi.org/10.1007/978-3-642-54013-4_5__In VMCAI 2014: Verification, Model Checking, and Abstract Interpretation, 8318:78–97. Springer Nature, 2014.https://doi.org/10.1007/978-3-642-54013-4_5 .

Chatterjee, Krishnendu, Andreas Pavlogiannis, Ben Adlam, and Martin Nowak. “The Time Scale of Evolutionary Innovation.”https://doi.org/10.1371/journal.pcbi.1003818__PLoS Computational Biology. Public Library of Science, 2014.https://doi.org/10.1371/journal.pcbi.1003818 .

Chatterjee, Krishnendu, Andreas Pavlogiannis, Ben Adlam, and Martin Novak. “Detailed Proofs for ‘The Time Scale of Evolutionary Innovation.’”https://doi.org/10.1371/journal.pcbi.1003818.s001__Public Library of Science, 2014.https://doi.org/10.1371/journal.pcbi.1003818.s001 .

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/s00453-013-9843-7__Algorithmica. Springer, 2014.https://doi.org/10.1007/s00453-013-9843-7 .

Chatterjee, Krishnendu, Martin Chmelik, and Przemyslaw Daca. “CEGAR for Qualitative Analysis of Probabilistic Systems,”https://doi.org/10.1007/978-3-319-08867-9_31__8559:473–90. Springer, 2014.https://doi.org/10.1007/978-3-319-08867-9_31 .

Chatterjee, Krishnendu, Thomas A Henzinger, Jan Otop, and Yaron Velner. Quantitative Fair Simulation Games. IST Austria, 2014.https://doi.org/10.15479/AT:IST-2014-315-v1-1 .

Chatterjee, Krishnendu, and Nathanaël Fijalkow. “Infinite-State Games with Finitary Conditions.”https://doi.org/10.4230/LIPIcs.CSL.2013.181__In 22nd EACSL Annual Conference on Computer Science Logic, 23:181–96. Leibniz International Proceedings in Informatics. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013.https://doi.org/10.4230/LIPIcs.CSL.2013.181 .

Chatterjee, Krishnendu, Vojtbch Forejt, and Dominik Wojtczak. “Multi-Objective Discounted Reward Verification in Graphs and MDPs.”https://doi.org/10.1007/978-3-642-45221-5_17__Lecture Notes in Computer Science. Springer, 2013.https://doi.org/10.1007/978-3-642-45221-5_17 .

Chatterjee, Krishnendu, and Jiri Sgall, eds. Mathematical Foundations of Computer Science 2013. Vol. 8087. Lecture Notes in Computer Science. Springer, 2013.https://doi.org/10.1007/978-3-642-40313-2 .

Godhal, Yashdeep, Krishnendu Chatterjee, and Thomas A Henzinger. “Synthesis of AMBA AHB from Formal Specification: A Case Study.”https://doi.org/10.1007/s10009-011-0207-9__International Journal on Software Tools for Technology Transfer. Springer, 2013.https://doi.org/10.1007/s10009-011-0207-9 .

Chatterjee, Krishnendu, Andreas Gaiser, and Jan Kretinsky. “Automata with Generalized Rabin Pairs for Probabilistic Model Checking and LTL Synthesis.”https://doi.org/10.1007/978-3-642-39799-8_37__Lecture Notes in Computer Science. Springer, 2013.https://doi.org/10.1007/978-3-642-39799-8_37 .

Chatterjee, Krishnendu, and Jakub aCki. “Faster Algorithms for Markov Decision Processes with Low Treewidth.”https://doi.org/10.1007/978-3-642-39799-8_36__Lecture Notes in Computer Science. Springer, 2013.https://doi.org/10.1007/978-3-642-39799-8_36 .

Chatterjee, Krishnendu, Luca Alfaro, and Ritankar Majumdar. “The Complexity of Coverage.”https://doi.org/10.1142/S0129054113400066__International Journal of Foundations of Computer Science. World Scientific Publishing, 2013.https://doi.org/10.1142/S0129054113400066 .

Novak, Sebastian, Krishnendu Chatterjee, and Martin Nowak. “Density Games.”https://doi.org/10.1016/j.jtbi.2013.05.029__Journal of Theoretical Biology. Elsevier, 2013.https://doi.org/10.1016/j.jtbi.2013.05.029 .

Chatterjee, Krishnendu, and Vinayak Prabhu. “Quantitative Timed Simulation Functions and Refinement Metrics for Real-Time Systems.”https://doi.org/10.1145/2461328.2461370__In Proceedings of the 16th International Conference on Hybrid Systems: Computation and Control, 1:273–82. Springer, 2013.https://doi.org/10.1145/2461328.2461370 .

Chatterjee, Krishnendu, and Vinayak Prabhu. “Synthesis of Memory-Efficient, Clock-Memory Free, and Non-Zeno Safety Controllers for Timed Systems.”https://doi.org/10.1016/j.ic.2013.04.003__Information and Computation. Elsevier, 2013.https://doi.org/10.1016/j.ic.2013.04.003 .

Chatterjee, Krishnendu, and Vishwanath Raman. “Assume-Guarantee Synthesis for Digital Contract Signing.”https://doi.org/10.1007/s00165-013-0283-6__Formal Aspects of Computing. Springer, 2013.https://doi.org/10.1007/s00165-013-0283-6 .

Chatterjee, Krishnendu, Luca De Alfaro, and Thomas A Henzinger. “Strategy Improvement for Concurrent Reachability and Turn Based Stochastic Safety Games.”https://doi.org/10.1016/j.jcss.2012.12.001__Journal of Computer and System Sciences. Elsevier, 2013.https://doi.org/10.1016/j.jcss.2012.12.001 .

Chmelik, Martin, and Vojtbch ehák. “Controllable-Choice Message Sequence Graphs.”https://doi.org/10.1007/978-3-642-36046-6_12__Lecture Notes in Computer Science. Springer, 2013.https://doi.org/10.1007/978-3-642-36046-6_12 .