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 
LibreCat: https://research-explorer.ista.ac.at/record/2053
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/2052
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/2187
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/2190
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/2234
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/2246
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/2716
DOI: 10.1007/s00236-013-0182-6
arXiv: 1201.5073

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 
LibreCat: https://research-explorer.ista.ac.at/record/1733
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/2141
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/2054
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/475
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/1903
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/2211
DOI: 10.1145/2579821
arXiv: 1107.2141

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 
LibreCat: https://research-explorer.ista.ac.at/record/2038
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/2162
DOI: 10.1007/978-3-662-43951-7_11
arXiv: 1404.5734

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 
LibreCat: https://research-explorer.ista.ac.at/record/2213
DOI: 10.1007/978-3-642-54830-7_16
arXiv: 1401.3289

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 
LibreCat: https://research-explorer.ista.ac.at/record/2212
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/2216
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/5413
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/5414
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/5412
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/2163
DOI: 10.1007/978-3-662-43951-7_10
arXiv: 1404.5453

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 
LibreCat: https://research-explorer.ista.ac.at/record/5419
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/5418
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/5420
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/5424
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/5426
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/5423
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/5427
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/5415
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/5421
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/10885
DOI: 10.1007/978-3-642-54013-4_5
arXiv: 1311.3238

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 
LibreCat: https://research-explorer.ista.ac.at/record/2039
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/9739
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/535
DOI: 10.1007/s00453-013-9843-7
arXiv: 1604.08234

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 
LibreCat: https://research-explorer.ista.ac.at/record/2063
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/5428
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/1374
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/2238
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/2292
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/2299
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/2446
DOI: 10.1007/978-3-642-39799-8_37
arXiv: 1304.5281

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 
LibreCat: https://research-explorer.ista.ac.at/record/2444
DOI: 10.1007/978-3-642-39799-8_36
arXiv: 1304.0084

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 
LibreCat: https://research-explorer.ista.ac.at/record/2814
DOI: 10.1142/S0129054113400066
arXiv: 0804.4525

Novak, S., Chatterjee, K., &; Nowak, M. (2013). Density games. Journal of Theoretical Biology. Elsevier.https://doi.org/10.1016/j.jtbi.2013.05.029 
LibreCat: https://research-explorer.ista.ac.at/record/2817
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/2819
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/2824
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/2836
DOI: 10.1007/s00165-013-0283-6
arXiv: 1004.2697

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 
LibreCat: https://research-explorer.ista.ac.at/record/2854
DOI: 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 
LibreCat: https://research-explorer.ista.ac.at/record/2886
DOI: 10.1007/978-3-642-36046-6_12