Chatterjee, K., Doyen, L., Gimbert, H., &; Henzinger, T. A. (2015). Randomness for free. Information and Computation. Elsevier.https://doi.org/10.1016/j.ic.2015.06.003 

Chatterjee, K., Henzinger, T. A., Jobstmann, B., &; Singh, R. (2015). Measuring and synthesizing systems in probabilistic environments. Journal of the ACM. ACM.https://doi.org/10.1145/2699430 

Chatterjee, K., Henzinger, M. H., &; Loitzenbauer, V. (2015). Improved algorithms for one-pair and k-pair Streett objectives. In Proceedings - Symposium on Logic in Computer Science (Vol. 2015–July). Kyoto, Japan: IEEE.https://doi.org/10.1109/LICS.2015.34 

Chatterjee, K., Doyen, L., Randour, M., &; Raskin, J. (2015). Looking at mean-payoff and total-payoff through windows. Information and Computation. Elsevier.https://doi.org/10.1016/j.ic.2015.03.010 

Chatterjee, K., &; Ibsen-Jensen, R. (2015). Qualitative analysis of concurrent mean payoff games. Information and Computation. Elsevier.https://doi.org/10.1016/j.ic.2015.03.009 

Ahmed, U., Chatterjee, K., &; Gulwani, S. (2015). Automatic generation of alternative starting positions for simple traditional board games. In Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence (Vol. 2, pp. 745–752). Austin, TX, USA: AAAI Press.

Chatterjee, K., Chmelik, M., Gupta, R., &; Kanodia, A. (2015). Qualitative analysis of POMDPs with temporal logic specifications for robotics applications (pp. 325–330). Presented at the ICRA: International Conference on Robotics and Automation, Seattle, WA, United States: IEEE.https://doi.org/10.1109/ICRA.2015.7139019 

Chatterjee, K., Ibsen-Jensen, R., &; Hansen, K. (2015). The patience of concurrent stochastic games with safety and reachability objectives. IST Austria.https://doi.org/10.15479/AT:IST-2015-322-v1-1 

Chatterjee, K., Komárková, Z., &; Kretinsky, J. (2015). Unifying two views on multiple mean-payoff objectives in Markov decision processes. Presented at the LICS: Logic in Computer Science, Kyoto, Japan: IEEE.https://doi.org/10.1109/LICS.2015.32 

Chatterjee, K., Henzinger, T. A., &; Otop, J. (2015). Nested weighted automata. In Proceedings - Symposium on Logic in Computer Science (Vol. 2015–July). Kyoto, Japan: IEEE.https://doi.org/10.1109/LICS.2015.72 

Chatterjee, K., Komarkova, Z., &; Kretinsky, J. (2015). Unifying two views on multiple mean-payoff objectives in Markov decision processes. IST Austria.https://doi.org/10.15479/AT:IST-2015-318-v1-1 

Chatterjee, K., Komarkova, Z., &; Kretinsky, J. (2015). Unifying two views on multiple mean-payoff objectives in Markov decision processes. IST Austria.https://doi.org/10.15479/AT:IST-2015-318-v2-1 

Chatterjee, K., Henzinger, T. A., &; Otop, J. (2015). Nested weighted automata. IST Austria.https://doi.org/10.15479/AT:IST-2015-170-v2-2 

Chatterjee, K., Henzinger, T. A., Ibsen-Jensen, R., &; Otop, J. (2015). Edit distance for pushdown automata. In 42nd International Colloquium (Vol. 9135, pp. 121–133). Kyoto, Japan: Springer Nature.https://doi.org/10.1007/978-3-662-47666-6_10 

Chatterjee, K., Ibsen-Jensen, R., &; Pavlogiannis, A. (2015). Faster algorithms for quantitative verification in constant treewidth graphs. IST Austria.https://doi.org/10.15479/AT:IST-2015-330-v2-1 

Chatterjee, K., Ibsen-Jensen, R., &; Pavlogiannis, A. (2015). Faster algorithms for quantitative verification in constant treewidth graphs. IST Austria.https://doi.org/10.15479/AT:IST-2015-319-v1-1 

Chatterjee, K., Henzinger, T. A., Ibsen-Jensen, R., &; Otop, J. (2015). Edit distance for pushdown automata. IST Austria.https://doi.org/10.15479/AT:IST-2015-334-v1-1 

Chatterjee, K., Ibsen-Jensen, R., &; Nowak, M. (2015). The complexity of evolutionary games on graphs. IST Austria.https://doi.org/10.15479/AT:IST-2015-323-v2-2 

Chatterjee, K., Ibsen-Jensen, R., &; Nowak, M. (2015). The complexity of evolutionary games on graphs. IST Austria.https://doi.org/10.15479/AT:IST-2015-323-v1-1 

Reiter, J., Makohon-Moore, A., Gerold, J., Bozic, I., Chatterjee, K., Iacobuzio-Donahue, C.,https://doi.org/10.15479/AT:IST-2015-399-v1-1__Nowak, M. (2015). Reconstructing robust phylogenies of metastatic cancers. IST Austria.https://doi.org/10.15479/AT:IST-2015-399-v1-1 

Chatterjee, K., Chmelik, M., &; Davies, J. (2015). A symbolic SAT-based algorithm for almost-sure reachability with small strategies in POMDPs. IST Austria.https://doi.org/10.15479/AT:IST-2015-325-v2-1 

Reiter, J., Kanodia, A., Gupta, R., Nowak, M., &; Chatterjee, K. (2015). Biological auctions with multiple rewards. Proceedings of the Royal Society of London Series B Biological Sciences. Royal Society.https://doi.org/10.1098/rspb.2015.1041 

Reiter, J. (2015). The subclonal evolution of cancer. Institute of Science and Technology Austria.

Benes, N., Daca, P., Henzinger, T. A., Kretinsky, J., &; Nickovic, D. (2015). Complete composition operators for IOCO-testing theory (pp. 101–110). Presented at the CBSE: Component-Based Software Engineering , Montreal, QC, Canada: ACM.https://doi.org/10.1145/2737166.2737175 

Chatterjee, K., Chmelik, M., &; Daca, P. (2015). CEGAR for compositional analysis of qualitative properties in Markov decision processes. Formal Methods in System Design. Springer.https://doi.org/10.1007/s10703-015-0235-2 

Chatterjee, K., Ibsen-Jensen, R., Pavlogiannis, A., &; Goyal, P. (2015). Faster algorithms for algebraic path properties in recursive state machines with constant treewidth. ACM SIGPLAN Notices. Mumbai, India: ACM.https://doi.org/10.1145/2676726.2676979 

Chatterjee, K., Pavlogiannis, A., &; Velner, Y. (2015). Quantitative interprocedural analysis. Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT . Mumbai, India: ACM.https://doi.org/10.1145/2676726.2676968 

Chatterjee, K., Ibsen-Jensen, R., &; Pavlogiannis, A. (2015). Faster algorithms for quantitative verification in constant treewidth graphs (Vol. 9206, pp. 140–157). Presented at the CAV: Computer Aided Verification, San Francisco, CA, USA: Springer.https://doi.org/10.1007/978-3-319-21690-4_9 

Chatterjee, K., Pavlogiannis, A., Kößler, A., &; Schmid, U. (2015). A framework for automated competitive analysis of on-line scheduling of firm-deadline tasks. In Real-Time Systems Symposium (Vol. 2015, pp. 118–127). Rome, Italy: IEEE.https://doi.org/10.1109/RTSS.2014.9 

Chatterjee, K., Ibsen-Jensen, R., Goharshady, A. K., &; Pavlogiannis, A. (2015). Algorithms for algebraic path properties in concurrent systems of constant treewidth components. IST Austria.https://doi.org/10.15479/AT:IST-2015-340-v1-1 

Svoreová, M., Kretinsky, J., Chmelik, M., Chatterjee, K., Cbrná, I., &; Belta, C. (2015). Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games. In Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control (pp. 259–268). Seattle, WA, United States: ACM.https://doi.org/10.1145/2728606.2728608 

Priklopil, T., &; Chatterjee, K. (2015). Evolution of decisions in population games with sequentially searching individuals. Games. MDPI.https://doi.org/10.3390/g6040413 

Brázdil, T., Chatterjee, K., Chmelik, M., Fellner, A., &; Kretinsky, J. (2015). Counterexample explanation by learning small strategies in Markov decision processes (Vol. 9206, pp. 158–177). Presented at the CAV: Computer Aided Verification, San Francisco, CA, United States: Springer.https://doi.org/10.1007/978-3-319-21690-4_10 

Aminof, B., Jacobs, S., Khalimov, A., &; Rubin, S. (2014). Parameterized model checking of token-passing systems. In Verification, Model Checking, and Abstract Interpretation (Vol. 8318, pp. 262–281). San Diego, CA, United States: Springer Nature.https://doi.org/10.1007/978-3-642-54013-4_15 

Chatterjee, K., Henzinger, M. H., Krinninger, S., Loitzenbauer, V., &; Raskin, M. (2014). Approximating the minimum cycle mean. Theoretical Computer Science. Elsevier.https://doi.org/10.1016/j.tcs.2014.06.031 

Jha, S., Tripakis, S., Seshia, S., &; Chatterjee, K. (2014). Game theoretic secure localization in wireless sensor networks (pp. 85–90). Presented at the IOT: Internet of Things, Cambridge, USA: IEEE.https://doi.org/10.1109/IOT.2014.7030120 

Landau, D., Stewart, C., Reiter, J., Lawrence, M., Sougnez, C., Brown, J.,  Wu, C. (2014). 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.

Brázdil, T., Chatterjee, K., Chmelik, M., Forejt, V., Kretinsky, J., Kwiatkowska, M.,https://doi.org/10.1007/978-3-319-11936-6_8__Ujma, M. (2014). Verification of markov decision processes using learning algorithms. In F. Cassez &; J.-F. Raskin (Eds.), 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) (Vol. 8837, pp. 98–114). Sydney, Australia: Society of Industrial and Applied Mathematics.https://doi.org/10.1007/978-3-319-11936-6_8 

Hermanns, H., Krdál, J., &; Kretinsky, J. (2014). Probabilistic bisimulation: Naturally on distributions. In P. Baldan &; D. Gorla (Eds.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8704, pp. 249–265). Rome, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.1007/978-3-662-44584-6_18 

Aminof, B., Kotek, T., Rubin, S., Spegni, F., &; Veith, H. (2014). Parameterized model checking of rendezvous systems. In P. Baldan &; D. Gorla (Eds.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8704, pp. 109–124). Rome, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.1007/978-3-662-44584-6_9 

Bloem, R., Chatterjee, K., Greimel, K., Henzinger, T. A., Hofferek, G., Jobstmann, B.,https://doi.org/10.1007/s00236-013-0191-5__Könighofer, R. (2014). Synthesizing robust systems. Acta Informatica. Springer.https://doi.org/10.1007/s00236-013-0191-5 

Esparza, J., &; Kretinsky, J. (2014). From LTL to deterministic automata: A safraless compositional approach (Vol. 8559, pp. 192–208). Presented at the CAV: Computer Aided Verification, Springer.https://doi.org/10.1007/978-3-319-08867-9_13 

Brázdil, T., Broeek, V., Chatterjee, K., Forejt, V., &; Kudera, A. (2014). Markov decision processes with multiple long-run average objectives. Logical Methods in Computer Science. International Federation of Computational Logic.https://doi.org/10.2168/LMCS-10(1:13)2014 

Grinshpun, A., Phalitnonkiat, P., Rubin, S., &; Tarfulea, A. (2014). Alternating traps in Muller and parity games. Theoretical Computer Science. Elsevier.https://doi.org/10.1016/j.tcs.2013.11.032 

Chatterjee, K., Randour, M., &; Raskin, J. (2014). Strategy synthesis for multi-dimensional quantitative objectives. Acta Informatica. Springer.https://doi.org/10.1007/s00236-013-0182-6 

Cerny, P., Chmelik, M., Henzinger, T. A., &; Radhakrishna, A. (2014). Interface simulation distances. Theoretical Computer Science. Elsevier.https://doi.org/10.1016/j.tcs.2014.08.019 

Chatterjee, K., &; Henzinger, M. H. (2014). Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition. Journal of the ACM. ACM.https://doi.org/10.1145/2597631 

Chatterjee, K. (2014). Qualitative concurrent parity games: Bounded rationality. In P. Baldan &; D. Gorla (Eds.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8704, pp. 544–559). Rome, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.1007/978-3-662-44584-6_37 

Aminof, B., &; Rubin, S. (2014). First cycle games. In Electronic Proceedings in Theoretical Computer Science, EPTCS (Vol. 146, pp. 83–90). Grenoble, France: Open Publishing Association.https://doi.org/10.4204/EPTCS.146.11 

Chatterjee, K. (2014). Partial-observation stochastic reachability and parity games (Vol. 8634, pp. 1–4). Presented at the MFCS: Mathematical Foundations of Computer Science, Budapest, Hungary: Springer.https://doi.org/10.1007/978-3-662-44522-8_1 

Chatterjee, K., &; Doyen, L. (2014). Partial-observation stochastic games: How to win when belief fails. ACM Transactions on Computational Logic (TOCL). ACM.https://doi.org/10.1145/2579821 

Boker, U., Chatterjee, K., Henzinger, T. A., &; Kupferman, O. (2014). Temporal specifications with accumulative values. ACM Transactions on Computational Logic (TOCL). ACM.https://doi.org/10.1145/2629686 

Chatterjee, K., &; Ibsen-Jensen, R. (2014). The complexity of ergodic mean payoff games (Vol. 8573, pp. 122–133). Presented at the ICST: International Conference on Software Testing, Verification and Validation, Copenhagen, Denmark: Springer.https://doi.org/10.1007/978-3-662-43951-7_11 

Chatterjee, K., Doyen, L., Nain, S., &; Vardi, M. (2014). The complexity of partial-observation stochastic parity games with finite-memory strategies (Vol. 8412, pp. 242–257). Presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Grenoble, France: Springer.https://doi.org/10.1007/978-3-642-54830-7_16 

Chatterjee, K., Doyen, L., Gimbert, H., &; Oualhadj, Y. (2014). Perfect-information stochastic mean-payoff parity games (Vol. 8412, pp. 210–225). Presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Grenoble, France: Springer.https://doi.org/10.1007/978-3-642-54830-7_14 

Chatterjee, K., Ibsen-Jensen, R., &; Majumdar, R. (2014). Edit distance for timed automata (pp. 303–312). Presented at the HSCC: Hybrid Systems - Computation and Control, Berlin, Germany: Springer.https://doi.org/10.1145/2562059.2562141 

Chatterjee, K., Daca, P., &; Chmelik, M. (2014). CEGAR for qualitative analysis of probabilistic systems. IST Austria.https://doi.org/10.15479/AT:IST-2014-153-v2-2 

Chatterjee, K., Daca, P., &; Chmelik, M. (2014). CEGAR for qualitative analysis of probabilistic systems. IST Austria.https://doi.org/10.15479/AT:IST-2014-153-v3-1 

Chatterjee, K., Daca, P., &; Chmelik, M. (2014). CEGAR for qualitative analysis of probabilistic systems. IST Austria.https://doi.org/10.15479/AT:IST-2014-153-v1-1 

Chatterjee, K., &; Doyen, L. (2014). Games with a weak adversary. In Lecture Notes in Computer Science (Vol. 8573, pp. 110–121). Copenhagen, Denmark: Springer.https://doi.org/10.1007/978-3-662-43951-7_10 

Chatterjee, K., Ibsen-Jensen, R., &; Pavlogiannis, A. (2014). Improved algorithms for reachability and shortest path on low tree-width graphs. IST Austria.https://doi.org/10.15479/AT:IST-2014-187-v1-1 

Chatterjee, K., &; Doyen, L. (2014). Games with a weak adversary. IST Austria.https://doi.org/10.15479/AT:IST-2014-176-v1-1 

Chatterjee, K., &; Ibsen-Jensen, R. (2014). The value 1 problem for concurrent mean-payoff games. IST Austria.https://doi.org/10.15479/AT:IST-2014-191-v1-1 

Chatterjee, K., Chmelik, M., Gupta, R., &; Kanodia, A. (2014). Qualitative analysis of POMDPs with temporal logic specifications for robotics applications. IST Austria.https://doi.org/10.15479/AT:IST-2014-305-v1-1 

Chatterjee, K., Chmelik, M., Gupta, R., &; Kanodia, A. (2014). Qualitative analysis of POMDPs with temporal logic specifications for robotics applications. IST Austria.https://doi.org/10.15479/AT:IST-2014-305-v2-1 

Chatterjee, K., Kössler, A., Pavlogiannis, A., &; Schmid, U. (2014). A framework for automated competitive analysis of on-line scheduling of firm-deadline tasks. IST Austria.https://doi.org/10.15479/AT:IST-2014-300-v1-1 

Chatterjee, K., Ibsen-Jensen, R., &; Pavlogiannis, A. (2014). Optimal tree-decomposition balancing and reachability on low treewidth graphs. IST Austria.https://doi.org/10.15479/AT:IST-2014-314-v1-1 

Chatterjee, K., Henzinger, T. A., &; Otop, J. (2014). Nested weighted automata. IST Austria.https://doi.org/10.15479/AT:IST-2014-170-v1-1 

Chatterjee, K., Ibsen-Jensen, R., &; Nowak, M. (2014). The complexity of evolution on graphs. IST Austria.https://doi.org/10.15479/AT:IST-2014-190-v2-2 

Chatterjee, K., Doyen, L., Filiot, E., &; Raskin, J.-F. (2014). Doomsday equilibria for omega-regular games. In VMCAI 2014: Verification, Model Checking, and Abstract Interpretation (Vol. 8318, pp. 78–97). San Diego, CA, United States: Springer Nature.https://doi.org/10.1007/978-3-642-54013-4_5 

Chatterjee, K., Pavlogiannis, A., Adlam, B., &; Nowak, M. (2014). The time scale of evolutionary innovation. PLoS Computational Biology. Public Library of Science.https://doi.org/10.1371/journal.pcbi.1003818 

Chatterjee, K., Pavlogiannis, A., Adlam, B., &; Novak, M. (2014). Detailed proofs for “The time scale of evolutionary innovation.”https://doi.org/10.1371/journal.pcbi.1003818.s001__Public Library of Science.https://doi.org/10.1371/journal.pcbi.1003818.s001 

Chatterjee, K., Henzinger, M. H., Krinninger, S., &; Nanongkai, D. (2014). Polynomial-time algorithms for energy games with special weight structures. Algorithmica. Springer.https://doi.org/10.1007/s00453-013-9843-7 

Chatterjee, K., Chmelik, M., &; Daca, P. (2014). CEGAR for qualitative analysis of probabilistic systems (Vol. 8559, pp. 473–490). Presented at the CAV: Computer Aided Verification, Vienna, Austria: Springer.https://doi.org/10.1007/978-3-319-08867-9_31 

Chatterjee, K., Henzinger, T. A., Otop, J., &; Velner, Y. (2014). Quantitative fair simulation games. IST Austria.https://doi.org/10.15479/AT:IST-2014-315-v1-1 

Chatterjee, K., &; Fijalkow, N. (2013). Infinite-state games with finitary conditions. In 22nd EACSL Annual Conference on Computer Science Logic (Vol. 23, pp. 181–196). Torino, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.CSL.2013.181 

Chatterjee, K., Forejt, V., &; Wojtczak, D. (2013). Multi-objective discounted reward verification in graphs and MDPs. Presented at the LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, Stellenbosch, South Africa: Springer.https://doi.org/10.1007/978-3-642-45221-5_17 

Chatterjee, K., &; Sgall, J. (Eds.). (2013). Mathematical Foundations of Computer Science 2013 (Vol. 8087, p. VI-854). Presented at the MFCS: Mathematical Foundations of Computer Science, Klosterneuburg, Austria: Springer.https://doi.org/10.1007/978-3-642-40313-2 

Godhal, Y., Chatterjee, K., &; Henzinger, T. A. (2013). Synthesis of AMBA AHB from formal specification: A case study. International Journal on Software Tools for Technology Transfer. Springer.https://doi.org/10.1007/s10009-011-0207-9 

Chatterjee, K., Gaiser, A., &; Kretinsky, J. (2013). Automata with generalized Rabin pairs for probabilistic model checking and LTL synthesis. Presented at the CAV: Computer Aided Verification, St. Petersburg, Russia: Springer.https://doi.org/10.1007/978-3-642-39799-8_37 

Chatterjee, K., &; aCki, J. (2013). Faster algorithms for Markov decision processes with low treewidth. Presented at the CAV: Computer Aided Verification, St. Petersburg, Russia: Springer.https://doi.org/10.1007/978-3-642-39799-8_36 

Chatterjee, K., Alfaro, L., &; Majumdar, R. (2013). The complexity of coverage. International Journal of Foundations of Computer Science. World Scientific Publishing.https://doi.org/10.1142/S0129054113400066 

Novak, S., Chatterjee, K., &; Nowak, M. (2013). Density games. Journal of Theoretical Biology. Elsevier.https://doi.org/10.1016/j.jtbi.2013.05.029 

Chatterjee, K., &; Prabhu, V. (2013). Quantitative timed simulation functions and refinement metrics for real-time systems. In Proceedings of the 16th International Conference on Hybrid Systems: Computation and Control (Vol. 1, pp. 273–282). Philadelphia, PA USA: Springer.https://doi.org/10.1145/2461328.2461370 

Chatterjee, K., &; Prabhu, V. (2013). Synthesis of memory-efficient, clock-memory free, and non-Zeno safety controllers for timed systems. Information and Computation. Elsevier.https://doi.org/10.1016/j.ic.2013.04.003 

Chatterjee, K., &; Raman, V. (2013). Assume-guarantee synthesis for digital contract signing. Formal Aspects of Computing. Springer.https://doi.org/10.1007/s00165-013-0283-6 

Chatterjee, K., De Alfaro, L., &; Henzinger, T. A. (2013). Strategy improvement for concurrent reachability and turn based stochastic safety games. Journal of Computer and System Sciences. Elsevier.https://doi.org/10.1016/j.jcss.2012.12.001 

Chmelik, M., &; ehák, V. (2013). Controllable-choice message sequence graphs. Presented at the MEMICS: Mathematical and Engineering Methods in Computer Science, Znojmo, Czech Republic: Springer.https://doi.org/10.1007/978-3-642-36046-6_12 

Chatterjee, K., De Alfaro, L., Faella, M., Majumdar, R., &; Raman, V. (2013). Code aware resource management. Formal Methods in System Design. Springer.https://doi.org/10.1007/s10703-012-0170-4 

Chatterjee, K., Henzinger, M. H., Joglekar, M., &; Shah, N. (2013). Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives. Formal Methods in System Design. Springer.https://doi.org/10.1007/s10703-012-0180-2 

Chatterjee, K., Doyen, L., Randour, M., &; Raskin, J. (2013). Looking at mean-payoff and total-payoff through windows. Presented at the ATVA: Automated Technology for Verification and Analysis, Hanoi, Vietnam: Springer.https://doi.org/10.1007/978-3-319-02444-8_10 

Reiter, J., Bozic, I., Chatterjee, K., &; Nowak, M. (2013). TTP: Tool for Tumor Progression. IST Austria.https://doi.org/10.15479/AT:IST-2013-104-v1-1 

Chatterjee, K., Chmelik, M., &; Tracol, M. (2013). What is decidable about partially observable Markov decision processes with omega-regular objectives. Presented at the CSL: Computer Science Logic, Torino, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.CSL.2013.165 

Chatterjee, K., &; Ibsen-Jensen, R. (2013). Qualitative analysis of concurrent mean-payoff games. IST Austria.https://doi.org/10.15479/AT:IST-2013-126-v1-1 

Chatterjee, K., Chmelik, M., &; Tracol, M. (2013). What is decidable about partially observable Markov decision processes with <9-regular objectives. IST Austria.https://doi.org/10.15479/AT:IST-2013-109-v1-1 

Chatterjee, K., &; Ibsen-Jensen, R. (2013). The complexity of ergodic games. IST Austria.https://doi.org/10.15479/AT:IST-2013-127-v1-1 

Chatterjee, K., Doyen, L., Gimbert, H., &; Oualhadj, Y. (2013). Perfect-information stochastic mean-payoff parity games. IST Austria.https://doi.org/10.15479/AT:IST-2013-128-v1-1 

Chatterjee, K., Ibsen-Jensen, R., &; Majumdar, R. (2013). Edit distance for timed automata. IST Austria.https://doi.org/10.15479/AT:IST-2013-144-v1-1 

Chatterjee, K., Henzinger, T. A., Otop, J., &; Pavlogiannis, A. (2013). Distributed synthesis for LTL fragments. In 13th International Conference on Formal Methods in Computer-Aided Design (pp. 18–25). Portland, OR, United States: IEEE.https://doi.org/10.1109/FMCAD.2013.6679386 

Chatterjee, K., Henzinger, T. A., Otop, J., &; Pavlogiannis, A. (2013). Distributed synthesis for LTL Fragments. IST Austria.https://doi.org/10.15479/AT:IST-2013-130-v1-1