Forejt, Vojtbch, Jan Krdál, and Jan Kretinsky. “Controller Synthesis for MDPs and Frequency LTL\'47U,”https://doi.org/10.1007/978-3-662-48899-7_12__9450:162–77. Springer, 2015.https://doi.org/10.1007/978-3-662-48899-7_12 .

Babiak, Tomás, Frantisek Blahoudek, Alexandre Duret Lutz, Joachim Klein, Jan Kretinsky, Daniel Mueller, David Parker, and Jan Strejdek. “The Hanoi Omega-Automata Format,”https://doi.org/10.1007/978-3-319-21690-4_31__9206:479–86. Springer, 2015.https://doi.org/10.1007/978-3-319-21690-4_31 .

Chatterjee, Krishnendu, Laurent Doyen, and Moshe Vardi. “The Complexity of Synthesis from Probabilistic Components.”https://doi.org/10.1007/978-3-662-47666-6_9__In 42nd International Colloquium, 9135:108–20. Springer Nature, 2015.https://doi.org/10.1007/978-3-662-47666-6_9 .

Pavlogiannis, Andreas, Krishnendu Chatterjee, Ben Adlam, and Martin Nowak. “Cellular Cooperation with Shift Updating and Repulsion.”https://doi.org/10.1038/srep17147__Scientific Reports. Nature Publishing Group, 2015.https://doi.org/10.1038/srep17147 .

Brázdil, Tomás, Stefan Kiefer, Antonín Kudera, and Petr Novotný. “Long-Run Average Behaviour of Probabilistic Vector Addition Systems,”https://doi.org/10.1109/LICS.2015.15__44–55. IEEE, 2015.https://doi.org/10.1109/LICS.2015.15 .

Landau, Dan, Eugen Tausch, Amaro Taylor Weiner, Chip Stewart, Johannes Reiter, Jasmin Bahlo, Sandra Kluth, et al. “Mutations Driving CLL and Their Evolution in Progression and Relapse.”https://doi.org/10.1038/nature15395__Nature. Nature Publishing Group, 2015.https://doi.org/10.1038/nature15395 .

Brázdil, Tomás, L’Ubos Korendiak, Jan Krdál, Petr Novotný, and Vojtbch ehák. “Optimizing Performance of Continuous-Time Stochastic Systems Using Timeout Synthesis.”https://doi.org/10.1007/978-3-319-22264-6_10__Lecture Notes in Computer Science. Springer, 2015.https://doi.org/10.1007/978-3-319-22264-6_10 .

Adlam, Ben, Krishnendu Chatterjee, and Martin Nowak. “Amplifiers of Selection.”https://doi.org/10.1098/rspa.2015.0114__Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences. Royal Society of London, 2015.https://doi.org/10.1098/rspa.2015.0114 .

Svoreová, Mária, Martin Chmelik, Kevin Leahy, Hasan Eniser, Krishnendu Chatterjee, Ivana Cbrná, and Celin Belta. “Temporal Logic Motion Planning Using POMDPs with Parity Objectives: Case Study Paper.”https://doi.org/10.1145/2728606.2728617__In Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control, 233–38. ACM, 2015.https://doi.org/10.1145/2728606.2728617 .

Chatterjee, Krishnendu, and Vinayak Prabhu. “Quantitative Temporal Simulation and Refinement Distances for Timed Systems.”https://doi.org/10.1109/TAC.2015.2404612__IEEE Transactions on Automatic Control. IEEE, 2015.https://doi.org/10.1109/TAC.2015.2404612 .

Velner, Yaron, Krishnendu Chatterjee, Laurent Doyen, Thomas A Henzinger, Alexander Rabinovich, and Jean Raskin. “The Complexity of Multi-Mean-Payoff and Multi-Energy Games.”https://doi.org/10.1016/j.ic.2015.03.001__Information and Computation. Elsevier, 2015.https://doi.org/10.1016/j.ic.2015.03.001 .

Chatterjee, Krishnendu, Martin Chmelik, Raghav Gupta, and Ayush Kanodia. “Optimal Cost Almost-Sure Reachability in POMDPs.” In Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence , 5:3496–3502. AAAI Press, 2015.

Bloem, Roderick, Krishnendu Chatterjee, Swen Jacobs, and Robert Könighofer. “Assume-Guarantee Synthesis for Concurrent Reactive Programs with Partial Information,”https://doi.org/10.1007/978-3-662-46681-0_50__9035:517–32. Springer, 2015.https://doi.org/10.1007/978-3-662-46681-0_50 .

Brázdil, Tomás, Krishnendu Chatterjee, Vojtbch Forejt, and Antonín Kudera. “Multigain: A Controller Synthesis Tool for MDPs with Multiple Mean-Payoff Objectives.”https://doi.org/10.1007/978-3-662-46681-0_12__Lecture Notes in Computer Science. Springer, 2015.https://doi.org/10.1007/978-3-662-46681-0_12 .

Benes, Nikola, Jan Kretinsky, Kim Larsen, Mikael Möller, Salomon Sickert, and Jií Srba. “Refinement Checking on Parametric Modal Transition Systems.”https://doi.org/10.1007/s00236-015-0215-4__Acta Informatica. Springer, 2015.https://doi.org/10.1007/s00236-015-0215-4 .

Priklopil, Tadeas, Eva Kisdi, and Mats Gyllenberg. “Evolutionarily Stable Mating Decisions for Sequentially Searching Females and the Stability of Reproductive Isolation by Assortative Mating.”https://doi.org/10.1111/evo.12618__Evolution. Wiley, 2015.https://doi.org/10.1111/evo.12618 .

Chatterjee, Krishnendu, and Martin Chmelik. “POMDPs under Probabilistic Semantics.”https://doi.org/10.1016/j.artint.2014.12.009__Artificial Intelligence. Elsevier, 2015.https://doi.org/10.1016/j.artint.2014.12.009 .

Fahrenberg, Uli, Jan Kretinsky, Axel Legay, and Louis Traonouez. “Compositionality for Quantitative Specifications,”https://doi.org/10.1007/978-3-319-15317-9_19__8997:306–24. Springer, 2015.https://doi.org/10.1007/978-3-319-15317-9_19 .

Bérard, Béatrice, Krishnendu Chatterjee, and Nathalie Sznajder. “Probabilistic Opacity for Markov Decision Processes.”https://doi.org/10.1016/j.ipl.2014.09.001__https://doi.org/10.1016/j.ipl.2014.09.001__Information Processing Letters. Elsevier, 2015.https://doi.org/10.1016/j.ipl.2014.09.001 .

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.1016/j.tcs.2015.01.050__Theoretical Computer Science. Elsevier, 2015.https://doi.org/10.1016/j.tcs.2015.01.050 .

Chatterjee, Krishnendu, Laurent Doyen, Hugo Gimbert, and Thomas A Henzinger. “Randomness for Free.”https://doi.org/10.1016/j.ic.2015.06.003__Information and Computation. Elsevier, 2015.https://doi.org/10.1016/j.ic.2015.06.003 .

Chatterjee, Krishnendu, Thomas A Henzinger, Barbara Jobstmann, and Rohit Singh. “Measuring and Synthesizing Systems in Probabilistic Environments.”https://doi.org/10.1145/2699430__Journal of the ACM. ACM, 2015.https://doi.org/10.1145/2699430 .

Chatterjee, Krishnendu, Monika H Henzinger, and Veronika Loitzenbauer. “Improved Algorithms for One-Pair and k-Pair Streett Objectives.”https://doi.org/10.1109/LICS.2015.34__In Proceedings - Symposium on Logic in Computer Science, Vol. 2015–July. IEEE, 2015.https://doi.org/10.1109/LICS.2015.34 .

Chatterjee, Krishnendu, Laurent Doyen, Mickael Randour, and Jean Raskin. “Looking at Mean-Payoff and Total-Payoff through Windows.”https://doi.org/10.1016/j.ic.2015.03.010__Information and Computation. Elsevier, 2015.https://doi.org/10.1016/j.ic.2015.03.010 .

Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. “Qualitative Analysis of Concurrent Mean Payoff Games.”https://doi.org/10.1016/j.ic.2015.03.009__Information and Computation. Elsevier, 2015.https://doi.org/10.1016/j.ic.2015.03.009 .

Ahmed, Umair, Krishnendu Chatterjee, and Sumit Gulwani. “Automatic Generation of Alternative Starting Positions for Simple Traditional Board Games.” In Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2:745–52. AAAI Press, 2015.

Chatterjee, Krishnendu, Martin Chmelik, Raghav Gupta, and Ayush Kanodia. “Qualitative Analysis of POMDPs with Temporal Logic Specifications for Robotics Applications,”https://doi.org/10.1109/ICRA.2015.7139019__325–30. IEEE, 2015.https://doi.org/10.1109/ICRA.2015.7139019 .

Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Kristoffer Hansen. The Patience of Concurrent Stochastic Games with Safety and Reachability Objectives. IST Austria, 2015.https://doi.org/10.15479/AT:IST-2015-322-v1-1 .

Chatterjee, Krishnendu, Zuzana Komárková, and Jan Kretinsky. “Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes.”https://doi.org/10.1109/LICS.2015.32__LICS. IEEE, 2015.https://doi.org/10.1109/LICS.2015.32 .

Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Nested Weighted Automata.”https://doi.org/10.1109/LICS.2015.72__In Proceedings - Symposium on Logic in Computer Science, Vol. 2015–July. IEEE, 2015.https://doi.org/10.1109/LICS.2015.72 .

Chatterjee, Krishnendu, Zuzana Komarkova, and Jan Kretinsky. Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes. IST Austria, 2015.https://doi.org/10.15479/AT:IST-2015-318-v1-1 .

Chatterjee, Krishnendu, Zuzana Komarkova, and Jan Kretinsky. Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes. IST Austria, 2015.https://doi.org/10.15479/AT:IST-2015-318-v2-1 .

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

Chatterjee, Krishnendu, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Jan Otop. “Edit Distance for Pushdown Automata.”https://doi.org/10.1007/978-3-662-47666-6_10__In 42nd International Colloquium, 9135:121–33. Springer Nature, 2015.https://doi.org/10.1007/978-3-662-47666-6_10 .

Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs. IST Austria, 2015.https://doi.org/10.15479/AT:IST-2015-330-v2-1 .

Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs. IST Austria, 2015.https://doi.org/10.15479/AT:IST-2015-319-v1-1 .

Chatterjee, Krishnendu, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Jan Otop. Edit Distance for Pushdown Automata. IST Austria, 2015.https://doi.org/10.15479/AT:IST-2015-334-v1-1 .

Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Martin Nowak. The Complexity of Evolutionary Games on Graphs. IST Austria, 2015.https://doi.org/10.15479/AT:IST-2015-323-v2-2 .

Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Martin Nowak. The Complexity of Evolutionary Games on Graphs. IST Austria, 2015.https://doi.org/10.15479/AT:IST-2015-323-v1-1 .

Reiter, Johannes, Alvin Makohon-Moore, Jeffrey Gerold, Ivana Bozic, Krishnendu Chatterjee, Christine Iacobuzio-Donahue, Bert Vogelstein, and Martin Nowak. Reconstructing Robust Phylogenies of Metastatic Cancers. IST Austria, 2015.https://doi.org/10.15479/AT:IST-2015-399-v1-1 .

Chatterjee, Krishnendu, Martin Chmelik, and Jessica Davies. A Symbolic SAT-Based Algorithm for Almost-Sure Reachability with Small Strategies in POMDPs. IST Austria, 2015.https://doi.org/10.15479/AT:IST-2015-325-v2-1 .

Reiter, Johannes, Ayush Kanodia, Raghav Gupta, Martin Nowak, and Krishnendu Chatterjee. “Biological Auctions with Multiple Rewards.”https://doi.org/10.1098/rspb.2015.1041__Proceedings of the Royal Society of London Series B Biological Sciences. Royal Society, 2015.https://doi.org/10.1098/rspb.2015.1041 .

Reiter, Johannes. “The Subclonal Evolution of Cancer.” Institute of Science and Technology Austria, 2015.

Benes, Nikola, Przemyslaw Daca, Thomas A Henzinger, Jan Kretinsky, and Dejan Nickovic. “Complete Composition Operators for IOCO-Testing Theory,”https://doi.org/10.1145/2737166.2737175__101–10. ACM, 2015.https://doi.org/10.1145/2737166.2737175 .

Chatterjee, Krishnendu, Martin Chmelik, and Przemyslaw Daca. “CEGAR for Compositional Analysis of Qualitative Properties in Markov Decision Processes.”https://doi.org/10.1007/s10703-015-0235-2__Formal Methods in System Design. Springer, 2015.https://doi.org/10.1007/s10703-015-0235-2 .

Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, Andreas Pavlogiannis, and Prateesh Goyal. “Faster Algorithms for Algebraic Path Properties in Recursive State Machines with Constant Treewidth.”https://doi.org/10.1145/2676726.2676979__ACM SIGPLAN Notices. ACM, 2015.https://doi.org/10.1145/2676726.2676979 .

Chatterjee, Krishnendu, Andreas Pavlogiannis, and Yaron Velner. “Quantitative Interprocedural Analysis.”https://doi.org/10.1145/2676726.2676968__Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT . ACM, 2015.https://doi.org/10.1145/2676726.2676968 .

Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis. “Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs,”https://doi.org/10.1007/978-3-319-21690-4_9__9206:140–57. Springer, 2015.https://doi.org/10.1007/978-3-319-21690-4_9 .

Chatterjee, Krishnendu, Andreas Pavlogiannis, Alexander Kößler, and Ulrich Schmid. “A Framework for Automated Competitive Analysis of On-Line Scheduling of Firm-Deadline Tasks.”https://doi.org/10.1109/RTSS.2014.9__In Real-Time Systems Symposium, 2015:118–27. IEEE, 2015.https://doi.org/10.1109/RTSS.2014.9 .

Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, Amir Kafshdar Goharshady, and Andreas Pavlogiannis. Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components. IST Austria, 2015.https://doi.org/10.15479/AT:IST-2015-340-v1-1 .

Svoreová, Mária, Jan Kretinsky, Martin Chmelik, Krishnendu Chatterjee, Ivana Cbrná, and Celin Belta. “Temporal Logic Control for Stochastic Linear Systems Using Abstraction Refinement of Probabilistic Games.”https://doi.org/10.1145/2728606.2728608__In Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control, 259–68. ACM, 2015.https://doi.org/10.1145/2728606.2728608 .

Priklopil, Tadeas, and Krishnendu Chatterjee. “Evolution of Decisions in Population Games with Sequentially Searching Individuals.”https://doi.org/10.3390/g6040413__Games. MDPI, 2015.https://doi.org/10.3390/g6040413 .

Brázdil, Tomás, Krishnendu Chatterjee, Martin Chmelik, Andreas Fellner, and Jan Kretinsky. “Counterexample Explanation by Learning Small Strategies in Markov Decision Processes,”https://doi.org/10.1007/978-3-319-21690-4_10__9206:158–77. Springer, 2015.https://doi.org/10.1007/978-3-319-21690-4_10 .

Aminof, Benjamin, Swen Jacobs, Ayrat Khalimov, and Sasha Rubin. “Parameterized Model Checking of Token-Passing Systems.”https://doi.org/10.1007/978-3-642-54013-4_15__In Verification, Model Checking, and Abstract Interpretation, 8318:262–81. Springer Nature, 2014.https://doi.org/10.1007/978-3-642-54013-4_15 .

Chatterjee, Krishnendu, Monika H Henzinger, Sebastian Krinninger, Veronika Loitzenbauer, and Michael Raskin. “Approximating the Minimum Cycle Mean.”https://doi.org/10.1016/j.tcs.2014.06.031__Theoretical Computer Science. Elsevier, 2014.https://doi.org/10.1016/j.tcs.2014.06.031 .

Jha, Susmit, Stavros Tripakis, Sanjit Seshia, and Krishnendu Chatterjee. “Game Theoretic Secure Localization in Wireless Sensor Networks,”https://doi.org/10.1109/IOT.2014.7030120__85–90. IEEE, 2014.https://doi.org/10.1109/IOT.2014.7030120 .

Landau, Dan, Chip Stewart, Johannes Reiter, Michael Lawrence, Carrie Sougnez, Jennifer Brown, Armando Lopez Guillermo, et al. “Novel Putative Driver Gene Mutations in Chronic Lymphocytic Leukemia (CLL): Results from a Combined Analysis of Whole Exome Sequencing of 262 Primary CLL Aamples.” Blood. American Society of Hematology, 2014.

Brázdil, Tomás, Krishnendu Chatterjee, Martin Chmelik, Vojtbch Forejt, Jan Kretinsky, Marta Kwiatkowska, David Parker, and Mateusz Ujma. “Verification of Markov Decision Processes Using Learning Algorithms.”https://doi.org/10.1007/978-3-319-11936-6_8__In https://doi.org/10.1007/978-3-319-11936-6_8__Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), edited by Franck Cassez and Jean-François Raskin, 8837:98–114. Society of Industrial and Applied Mathematics, 2014.https://doi.org/10.1007/978-3-319-11936-6_8 .

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 .