K. Chatterjee and R. Ibsen-Jensen, “Qualitative analysis of concurrent mean payoff games,” Information and Computation, vol. 242, no. 6. Elsevier, pp. 2–24, 2015.
LibreCat: https://research-explorer.ista.ac.at/record/524
DOI: 10.1016/j.ic.2015.03.009
arXiv: 1409.5306

U. Ahmed, K. Chatterjee, and S. Gulwani, “Automatic generation of alternative starting positions for simple traditional board games,” in Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, Austin, TX, USA, 2015, vol. 2, pp. 745–752.
LibreCat: https://research-explorer.ista.ac.at/record/1481

K. Chatterjee, M. Chmelik, R. Gupta, and A. Kanodia, “Qualitative analysis of POMDPs with temporal logic specifications for robotics applications,” presented at the ICRA: International Conference on Robotics and Automation, Seattle, WA, United States, 2015, pp. 325–330.
LibreCat: https://research-explorer.ista.ac.at/record/1732
DOI: 10.1109/ICRA.2015.7139019
arXiv: 1409.3360

K. Chatterjee, R. Ibsen-Jensen, and K. Hansen, The patience of concurrent stochastic games with safety and reachability objectives. IST Austria, 2015.
LibreCat: https://research-explorer.ista.ac.at/record/5431
DOI: 10.15479/AT:IST-2015-322-v1-1

K. Chatterjee, Z. Komárková, and J. Kretinsky, “Unifying two views on multiple mean-payoff objectives in Markov decision processes.” IEEE, pp. 244–256, 2015.
LibreCat: https://research-explorer.ista.ac.at/record/1657
DOI: 10.1109/LICS.2015.32

K. Chatterjee, T. A. Henzinger, and J. Otop, “Nested weighted automata,” in Proceedings - Symposium on Logic in Computer Science, Kyoto, Japan, 2015, vol. 2015–July.
LibreCat: https://research-explorer.ista.ac.at/record/1656
DOI: 10.1109/LICS.2015.72
arXiv: 1606.03598

K. Chatterjee, Z. Komarkova, and J. Kretinsky, Unifying two views on multiple mean-payoff objectives in Markov decision processes. IST Austria, 2015.
LibreCat: https://research-explorer.ista.ac.at/record/5429
DOI: 10.15479/AT:IST-2015-318-v1-1

K. Chatterjee, Z. Komarkova, and J. Kretinsky, Unifying two views on multiple mean-payoff objectives in Markov decision processes. IST Austria, 2015.
LibreCat: https://research-explorer.ista.ac.at/record/5435
DOI: 10.15479/AT:IST-2015-318-v2-1

K. Chatterjee, T. A. Henzinger, and J. Otop, Nested weighted automata. IST Austria, 2015.
LibreCat: https://research-explorer.ista.ac.at/record/5436
DOI: 10.15479/AT:IST-2015-170-v2-2

K. Chatterjee, T. A. Henzinger, R. Ibsen-Jensen, and J. Otop, “Edit distance for pushdown automata,” in 42nd International Colloquium, Kyoto, Japan, 2015, vol. 9135, no. Part II, pp. 121–133.
LibreCat: https://research-explorer.ista.ac.at/record/1610
DOI: 10.1007/978-3-662-47666-6_10
arXiv: 1504.08259

K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, Faster algorithms for quantitative verification in constant treewidth graphs. IST Austria, 2015.
LibreCat: https://research-explorer.ista.ac.at/record/5437
DOI: 10.15479/AT:IST-2015-330-v2-1

K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, Faster algorithms for quantitative verification in constant treewidth graphs. IST Austria, 2015.
LibreCat: https://research-explorer.ista.ac.at/record/5430
DOI: 10.15479/AT:IST-2015-319-v1-1

K. Chatterjee, T. A. Henzinger, R. Ibsen-Jensen, and J. Otop, Edit distance for pushdown automata. IST Austria, 2015.
LibreCat: https://research-explorer.ista.ac.at/record/5438
DOI: 10.15479/AT:IST-2015-334-v1-1

K. Chatterjee, R. Ibsen-Jensen, and M. Nowak, The complexity of evolutionary games on graphs. IST Austria, 2015.
LibreCat: https://research-explorer.ista.ac.at/record/5440
DOI: 10.15479/AT:IST-2015-323-v2-2

K. Chatterjee, R. Ibsen-Jensen, and M. Nowak, The complexity of evolutionary games on graphs. IST Austria, 2015.
LibreCat: https://research-explorer.ista.ac.at/record/5432
DOI: 10.15479/AT:IST-2015-323-v1-1

J. Reiter et al., Reconstructing robust phylogenies of metastatic cancers. IST Austria, 2015.
LibreCat: https://research-explorer.ista.ac.at/record/5444
DOI: 10.15479/AT:IST-2015-399-v1-1

K. Chatterjee, M. Chmelik, and J. Davies, A symbolic SAT-based algorithm for almost-sure reachability with small strategies in POMDPs. IST Austria, 2015.
LibreCat: https://research-explorer.ista.ac.at/record/5443
DOI: 10.15479/AT:IST-2015-325-v2-1

J. Reiter, A. Kanodia, R. Gupta, M. Nowak, and K. Chatterjee, “Biological auctions with multiple rewards,” Proceedings of the Royal Society of London Series B Biological Sciences, vol. 282, no. 1812. Royal Society, 2015.
LibreCat: https://research-explorer.ista.ac.at/record/1709
DOI: 10.1098/rspb.2015.1041
PMID: 26180069

J. Reiter, “The subclonal evolution of cancer,” Institute of Science and Technology Austria, 2015.
LibreCat: https://research-explorer.ista.ac.at/record/1400

N. Benes, P. Daca, T. A. Henzinger, J. Kretinsky, and D. Nickovic, “Complete composition operators for IOCO-testing theory,” presented at the CBSE: Component-Based Software Engineering , Montreal, QC, Canada, 2015, pp. 101–110.
LibreCat: https://research-explorer.ista.ac.at/record/1502
DOI: 10.1145/2737166.2737175

K. Chatterjee, M. Chmelik, and P. Daca, “CEGAR for compositional analysis of qualitative properties in Markov decision processes,” Formal Methods in System Design, vol. 47, no. 2. Springer, pp. 230–264, 2015.
LibreCat: https://research-explorer.ista.ac.at/record/1501
DOI: 10.1007/s10703-015-0235-2

K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, and P. Goyal, “Faster algorithms for algebraic path properties in recursive state machines with constant treewidth,” ACM SIGPLAN Notices, vol. 50, no. 1. ACM, pp. 97–109, 2015.
LibreCat: https://research-explorer.ista.ac.at/record/1602
DOI: 10.1145/2676726.2676979
arXiv: 1410.7724

K. Chatterjee, A. Pavlogiannis, and Y. Velner, “Quantitative interprocedural analysis,” Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT , vol. 50, no. 1. ACM, pp. 539–551, 2015.
LibreCat: https://research-explorer.ista.ac.at/record/1604
DOI: 10.1145/2676726.2676968

K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, “Faster algorithms for quantitative verification in constant treewidth graphs,” presented at the CAV: Computer Aided Verification, San Francisco, CA, USA, 2015, vol. 9206, pp. 140–157.
LibreCat: https://research-explorer.ista.ac.at/record/1607
DOI: 10.1007/978-3-319-21690-4_9

K. Chatterjee, A. Pavlogiannis, A. Kößler, and U. Schmid, “A framework for automated competitive analysis of on-line scheduling of firm-deadline tasks,” in Real-Time Systems Symposium, Rome, Italy, 2015, vol. 2015, no. January, pp. 118–127.
LibreCat: https://research-explorer.ista.ac.at/record/1714
DOI: 10.1109/RTSS.2014.9

K. Chatterjee, R. Ibsen-Jensen, A. K. Goharshady, and A. Pavlogiannis, Algorithms for algebraic path properties in concurrent systems of constant treewidth components. IST Austria, 2015.
LibreCat: https://research-explorer.ista.ac.at/record/5441
DOI: 10.15479/AT:IST-2015-340-v1-1

M. Svoreová, J. Kretinsky, M. Chmelik, K. Chatterjee, I. Cbrná, and C. Belta, “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, Seattle, WA, United States, 2015, pp. 259–268.
LibreCat: https://research-explorer.ista.ac.at/record/1689
DOI: 10.1145/2728606.2728608

T. Priklopil and K. Chatterjee, “Evolution of decisions in population games with sequentially searching individuals,” Games, vol. 6, no. 4. MDPI, pp. 413–437, 2015.
LibreCat: https://research-explorer.ista.ac.at/record/1681
DOI: 10.3390/g6040413

T. Brázdil, K. Chatterjee, M. Chmelik, A. Fellner, and J. Kretinsky, “Counterexample explanation by learning small strategies in Markov decision processes,” presented at the CAV: Computer Aided Verification, San Francisco, CA, United States, 2015, vol. 9206, pp. 158–177.
LibreCat: https://research-explorer.ista.ac.at/record/1603
DOI: 10.1007/978-3-319-21690-4_10

A. Fellner, “Experimental part of CAV 2015 publication: Counterexample Explanation by Learning Small Strategies in Markov Decision Processes.” Institute of Science and Technology Austria, 2015.
LibreCat: https://research-explorer.ista.ac.at/record/5549
DOI: 10.15479/AT:ISTA:28

B. Aminof, S. Jacobs, A. Khalimov, and S. Rubin, “Parameterized model checking of token-passing systems,” in Verification, Model Checking, and Abstract Interpretation, San Diego, CA, United States, 2014, vol. 8318, pp. 262–281.
LibreCat: https://research-explorer.ista.ac.at/record/10884
DOI: 10.1007/978-3-642-54013-4_15
arXiv: 1311.4425

K. Chatterjee, M. H. Henzinger, S. Krinninger, V. Loitzenbauer, and M. Raskin, “Approximating the minimum cycle mean,” Theoretical Computer Science, vol. 547, no. C. Elsevier, pp. 104–116, 2014.
LibreCat: https://research-explorer.ista.ac.at/record/1375
DOI: 10.1016/j.tcs.2014.06.031
arXiv: 1307.4473

S. Jha, S. Tripakis, S. Seshia, and K. Chatterjee, “Game theoretic secure localization in wireless sensor networks,” presented at the IOT: Internet of Things, Cambridge, USA, 2014, pp. 85–90.
LibreCat: https://research-explorer.ista.ac.at/record/1853
DOI: 10.1109/IOT.2014.7030120

D. Landau 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, vol. 124, no. 21. American Society of Hematology, pp. 1952–1952, 2014.
LibreCat: https://research-explorer.ista.ac.at/record/1884

T. Brázdil et al., “Verification of markov decision processes using learning algorithms,” in  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Sydney, Australia, 2014, vol. 8837, pp. 98–114.
LibreCat: https://research-explorer.ista.ac.at/record/2027
DOI: 10.1007/978-3-319-11936-6_8

H. Hermanns, J. Krdál, and J. Kretinsky, “Probabilistic bisimulation: Naturally on distributions,” in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Rome, Italy, 2014, vol. 8704, pp. 249–265.
LibreCat: https://research-explorer.ista.ac.at/record/2053
DOI: 10.1007/978-3-662-44584-6_18

B. Aminof, T. Kotek, S. Rubin, F. Spegni, and H. Veith, “Parameterized model checking of rendezvous systems,” in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Rome, Italy, 2014, vol. 8704, pp. 109–124.
LibreCat: https://research-explorer.ista.ac.at/record/2052
DOI: 10.1007/978-3-662-44584-6_9

R. Bloem et al., “Synthesizing robust systems,” Acta Informatica, vol. 51, no. 3–4. Springer, pp. 193–220, 2014.
LibreCat: https://research-explorer.ista.ac.at/record/2187
DOI: 10.1007/s00236-013-0191-5

J. Esparza and J. Kretinsky, “From LTL to deterministic automata: A safraless compositional approach,” presented at the CAV: Computer Aided Verification, 2014, vol. 8559, pp. 192–208.
LibreCat: https://research-explorer.ista.ac.at/record/2190
DOI: 10.1007/978-3-319-08867-9_13

T. Brázdil, V. Broeek, K. Chatterjee, V. Forejt, and A. Kudera, “Markov decision processes with multiple long-run average objectives,” Logical Methods in Computer Science, vol. 10, no. 1. International Federation of Computational Logic, 2014.
LibreCat: https://research-explorer.ista.ac.at/record/2234
DOI: 10.2168/LMCS-10(1:13)2014

A. Grinshpun, P. Phalitnonkiat, S. Rubin, and A. Tarfulea, “Alternating traps in Muller and parity games,” Theoretical Computer Science, vol. 521. Elsevier, pp. 73–91, 2014.
LibreCat: https://research-explorer.ista.ac.at/record/2246
DOI: 10.1016/j.tcs.2013.11.032

K. Chatterjee, M. Randour, and J. Raskin, “Strategy synthesis for multi-dimensional quantitative objectives,” Acta Informatica, vol. 51, no. 3–4. Springer, pp. 129–163, 2014.
LibreCat: https://research-explorer.ista.ac.at/record/2716
DOI: 10.1007/s00236-013-0182-6
arXiv: 1201.5073

P. Cerny, M. Chmelik, T. A. Henzinger, and A. Radhakrishna, “Interface simulation distances,” Theoretical Computer Science, vol. 560, no. 3. Elsevier, pp. 348–363, 2014.
LibreCat: https://research-explorer.ista.ac.at/record/1733
DOI: 10.1016/j.tcs.2014.08.019

K. Chatterjee and M. H. Henzinger, “Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition,” Journal of the ACM, vol. 61, no. 3. ACM, 2014.
LibreCat: https://research-explorer.ista.ac.at/record/2141
DOI: 10.1145/2597631

K. Chatterjee, “Qualitative concurrent parity games: Bounded rationality,” in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Rome, Italy, 2014, vol. 8704, pp. 544–559.
LibreCat: https://research-explorer.ista.ac.at/record/2054
DOI: 10.1007/978-3-662-44584-6_37

B. Aminof and S. Rubin, “First cycle games,” in Electronic Proceedings in Theoretical Computer Science, EPTCS, Grenoble, France, 2014, vol. 146, pp. 83–90.
LibreCat: https://research-explorer.ista.ac.at/record/475
DOI: 10.4204/EPTCS.146.11

K. Chatterjee, “Partial-observation stochastic reachability and parity games,” presented at the MFCS: Mathematical Foundations of Computer Science, Budapest, Hungary, 2014, vol. 8634, no. PART 1, pp. 1–4.
LibreCat: https://research-explorer.ista.ac.at/record/1903
DOI: 10.1007/978-3-662-44522-8_1

K. Chatterjee and L. Doyen, “Partial-observation stochastic games: How to win when belief fails,” ACM Transactions on Computational Logic (TOCL), vol. 15, no. 2. ACM, 2014.
LibreCat: https://research-explorer.ista.ac.at/record/2211
DOI: 10.1145/2579821
arXiv: 1107.2141

U. Boker, K. Chatterjee, T. A. Henzinger, and O. Kupferman, “Temporal specifications with accumulative values,” ACM Transactions on Computational Logic (TOCL), vol. 15, no. 4. ACM, 2014.
LibreCat: https://research-explorer.ista.ac.at/record/2038
DOI: 10.1145/2629686

K. Chatterjee and R. Ibsen-Jensen, “The complexity of ergodic mean payoff games,” presented at the ICST: International Conference on Software Testing, Verification and Validation, Copenhagen, Denmark, 2014, vol. 8573, no. Part 2, pp. 122–133.
LibreCat: https://research-explorer.ista.ac.at/record/2162
DOI: 10.1007/978-3-662-43951-7_11
arXiv: 1404.5734

K. Chatterjee, L. Doyen, S. Nain, and M. Vardi, “The complexity of partial-observation stochastic parity games with finite-memory strategies,” presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Grenoble, France, 2014, vol. 8412, pp. 242–257.
LibreCat: https://research-explorer.ista.ac.at/record/2213
DOI: 10.1007/978-3-642-54830-7_16
arXiv: 1401.3289

K. Chatterjee, L. Doyen, H. Gimbert, and Y. Oualhadj, “Perfect-information stochastic mean-payoff parity games,” presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Grenoble, France, 2014, vol. 8412, pp. 210–225.
LibreCat: https://research-explorer.ista.ac.at/record/2212
DOI: 10.1007/978-3-642-54830-7_14

K. Chatterjee, R. Ibsen-Jensen, and R. Majumdar, “Edit distance for timed automata,” presented at the HSCC: Hybrid Systems - Computation and Control, Berlin, Germany, 2014, pp. 303–312.
LibreCat: https://research-explorer.ista.ac.at/record/2216
DOI: 10.1145/2562059.2562141

K. Chatterjee, P. Daca, and M. Chmelik, CEGAR for qualitative analysis of probabilistic systems. IST Austria, 2014.
LibreCat: https://research-explorer.ista.ac.at/record/5413
DOI: 10.15479/AT:IST-2014-153-v2-2

K. Chatterjee, P. Daca, and M. Chmelik, CEGAR for qualitative analysis of probabilistic systems. IST Austria, 2014.
LibreCat: https://research-explorer.ista.ac.at/record/5414
DOI: 10.15479/AT:IST-2014-153-v3-1

K. Chatterjee, P. Daca, and M. Chmelik, CEGAR for qualitative analysis of probabilistic systems. IST Austria, 2014.
LibreCat: https://research-explorer.ista.ac.at/record/5412
DOI: 10.15479/AT:IST-2014-153-v1-1

K. Chatterjee and L. Doyen, “Games with a weak adversary,” in Lecture Notes in Computer Science, Copenhagen, Denmark, 2014, vol. 8573, no. Part 2, pp. 110–121.
LibreCat: https://research-explorer.ista.ac.at/record/2163
DOI: 10.1007/978-3-662-43951-7_10
arXiv: 1404.5453

K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, Improved algorithms for reachability and shortest path on low tree-width graphs. IST Austria, 2014.
LibreCat: https://research-explorer.ista.ac.at/record/5419
DOI: 10.15479/AT:IST-2014-187-v1-1

K. Chatterjee and L. Doyen, Games with a weak adversary. IST Austria, 2014.
LibreCat: https://research-explorer.ista.ac.at/record/5418
DOI: 10.15479/AT:IST-2014-176-v1-1

K. Chatterjee and R. Ibsen-Jensen, The value 1 problem for concurrent mean-payoff games. IST Austria, 2014.
LibreCat: https://research-explorer.ista.ac.at/record/5420
DOI: 10.15479/AT:IST-2014-191-v1-1

K. Chatterjee, M. Chmelik, R. Gupta, and A. Kanodia, Qualitative analysis of POMDPs with temporal logic specifications for robotics applications. IST Austria, 2014.
LibreCat: https://research-explorer.ista.ac.at/record/5424
DOI: 10.15479/AT:IST-2014-305-v1-1

K. Chatterjee, M. Chmelik, R. Gupta, and A. Kanodia, Qualitative analysis of POMDPs with temporal logic specifications for robotics applications. IST Austria, 2014.
LibreCat: https://research-explorer.ista.ac.at/record/5426
DOI: 10.15479/AT:IST-2014-305-v2-1

K. Chatterjee, A. Kössler, A. Pavlogiannis, and U. Schmid, A framework for automated competitive analysis of on-line scheduling of firm-deadline tasks. IST Austria, 2014.
LibreCat: https://research-explorer.ista.ac.at/record/5423
DOI: 10.15479/AT:IST-2014-300-v1-1

K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, Optimal tree-decomposition balancing and reachability on low treewidth graphs. IST Austria, 2014.
LibreCat: https://research-explorer.ista.ac.at/record/5427
DOI: 10.15479/AT:IST-2014-314-v1-1

K. Chatterjee, T. A. Henzinger, and J. Otop, Nested weighted automata. IST Austria, 2014.
LibreCat: https://research-explorer.ista.ac.at/record/5415
DOI: 10.15479/AT:IST-2014-170-v1-1

K. Chatterjee, R. Ibsen-Jensen, and M. Nowak, The complexity of evolution on graphs. IST Austria, 2014.
LibreCat: https://research-explorer.ista.ac.at/record/5421
DOI: 10.15479/AT:IST-2014-190-v2-2

K. Chatterjee, L. Doyen, E. Filiot, and J.-F. Raskin, “Doomsday equilibria for omega-regular games,” in VMCAI 2014: Verification, Model Checking, and Abstract Interpretation, San Diego, CA, United States, 2014, vol. 8318, pp. 78–97.
LibreCat: https://research-explorer.ista.ac.at/record/10885
DOI: 10.1007/978-3-642-54013-4_5
arXiv: 1311.3238

K. Chatterjee, A. Pavlogiannis, B. Adlam, and M. Nowak, “The time scale of evolutionary innovation,” PLoS Computational Biology, vol. 10, no. 9. Public Library of Science, 2014.
LibreCat: https://research-explorer.ista.ac.at/record/2039
DOI: 10.1371/journal.pcbi.1003818

K. Chatterjee, A. Pavlogiannis, B. Adlam, and M. Novak, “Detailed proofs for ‘The time scale of evolutionary innovation.’” Public Library of Science, 2014.
LibreCat: https://research-explorer.ista.ac.at/record/9739
DOI: 10.1371/journal.pcbi.1003818.s001

K. Chatterjee, M. H. Henzinger, S. Krinninger, and D. Nanongkai, “Polynomial-time algorithms for energy games with special weight structures,” Algorithmica, vol. 70, no. 3. Springer, pp. 457–492, 2014.
LibreCat: https://research-explorer.ista.ac.at/record/535
DOI: 10.1007/s00453-013-9843-7
arXiv: 1604.08234

K. Chatterjee, M. Chmelik, and P. Daca, “CEGAR for qualitative analysis of probabilistic systems,” presented at the CAV: Computer Aided Verification, Vienna, Austria, 2014, vol. 8559, pp. 473–490.
LibreCat: https://research-explorer.ista.ac.at/record/2063
DOI: 10.1007/978-3-319-08867-9_31

K. Chatterjee, T. A. Henzinger, J. Otop, and Y. Velner, Quantitative fair simulation games. IST Austria, 2014.
LibreCat: https://research-explorer.ista.ac.at/record/5428
DOI: 10.15479/AT:IST-2014-315-v1-1

K. Chatterjee and N. Fijalkow, “Infinite-state games with finitary conditions,” in 22nd EACSL Annual Conference on Computer Science Logic, Torino, Italy, 2013, vol. 23, pp. 181–196.
LibreCat: https://research-explorer.ista.ac.at/record/1374
DOI: 10.4230/LIPIcs.CSL.2013.181

K. Chatterjee, V. Forejt, and D. Wojtczak, “Multi-objective discounted reward verification in graphs and MDPs,” vol. 8312. Springer, pp. 228–242, 2013.
LibreCat: https://research-explorer.ista.ac.at/record/2238
DOI: 10.1007/978-3-642-45221-5_17

K. Chatterjee and J. Sgall, Eds., Mathematical Foundations of Computer Science 2013, vol. 8087. Springer, 2013, p. VI-854.
LibreCat: https://research-explorer.ista.ac.at/record/2292
DOI: 10.1007/978-3-642-40313-2

Y. Godhal, K. Chatterjee, and T. A. Henzinger, “Synthesis of AMBA AHB from formal specification: A case study,” International Journal on Software Tools for Technology Transfer, vol. 15, no. 5–6. Springer, pp. 585–601, 2013.
LibreCat: https://research-explorer.ista.ac.at/record/2299
DOI: 10.1007/s10009-011-0207-9

K. Chatterjee, A. Gaiser, and J. Kretinsky, “Automata with generalized Rabin pairs for probabilistic model checking and LTL synthesis,” vol. 8044. Springer, pp. 559–575, 2013.
LibreCat: https://research-explorer.ista.ac.at/record/2446
DOI: 10.1007/978-3-642-39799-8_37
arXiv: 1304.5281

K. Chatterjee and J. aCki, “Faster algorithms for Markov decision processes with low treewidth,” vol. 8044. Springer, pp. 543–558, 2013.
LibreCat: https://research-explorer.ista.ac.at/record/2444
DOI: 10.1007/978-3-642-39799-8_36
arXiv: 1304.0084

K. Chatterjee, L. Alfaro, and R. Majumdar, “The complexity of coverage,” International Journal of Foundations of Computer Science, vol. 24, no. 2. World Scientific Publishing, pp. 165–185, 2013.
LibreCat: https://research-explorer.ista.ac.at/record/2814
DOI: 10.1142/S0129054113400066
arXiv: 0804.4525

S. Novak, K. Chatterjee, and M. Nowak, “Density games,” Journal of Theoretical Biology, vol. 334. Elsevier, pp. 26–34, 2013.
LibreCat: https://research-explorer.ista.ac.at/record/2817
DOI: 10.1016/j.jtbi.2013.05.029

K. Chatterjee and V. Prabhu, “Quantitative timed simulation functions and refinement metrics for real-time systems,” in Proceedings of the 16th International Conference on Hybrid Systems: Computation and Control, Philadelphia, PA USA, 2013, vol. 1, pp. 273–282.
LibreCat: https://research-explorer.ista.ac.at/record/2819
DOI: 10.1145/2461328.2461370

K. Chatterjee and V. Prabhu, “Synthesis of memory-efficient, clock-memory free, and non-Zeno safety controllers for timed systems,” Information and Computation, vol. 228–229. Elsevier, pp. 83–119, 2013.
LibreCat: https://research-explorer.ista.ac.at/record/2824
DOI: 10.1016/j.ic.2013.04.003

K. Chatterjee and V. Raman, “Assume-guarantee synthesis for digital contract signing,” Formal Aspects of Computing, vol. 26, no. 4. Springer, pp. 825–859, 2013.
LibreCat: https://research-explorer.ista.ac.at/record/2836
DOI: 10.1007/s00165-013-0283-6
arXiv: 1004.2697

K. Chatterjee, L. De Alfaro, and T. A. Henzinger, “Strategy improvement for concurrent reachability and turn based stochastic safety games,” Journal of Computer and System Sciences, vol. 79, no. 5. Elsevier, pp. 640–657, 2013.
LibreCat: https://research-explorer.ista.ac.at/record/2854
DOI: 10.1016/j.jcss.2012.12.001

M. Chmelik and V. ehák, “Controllable-choice message sequence graphs,” vol. 7721. Springer, pp. 118–130, 2013.
LibreCat: https://research-explorer.ista.ac.at/record/2886
DOI: 10.1007/978-3-642-36046-6_12

K. Chatterjee, L. De Alfaro, M. Faella, R. Majumdar, and V. Raman, “Code aware resource management,” Formal Methods in System Design, vol. 42, no. 2. Springer, pp. 142–174, 2013.
LibreCat: https://research-explorer.ista.ac.at/record/3116
DOI: 10.1007/s10703-012-0170-4

K. Chatterjee, M. H. Henzinger, M. Joglekar, and N. Shah, “Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives,” Formal Methods in System Design, vol. 42, no. 3. Springer, pp. 301–327, 2013.
LibreCat: https://research-explorer.ista.ac.at/record/2831
DOI: 10.1007/s10703-012-0180-2
arXiv: 1104.3348

K. Chatterjee, L. Doyen, M. Randour, and J. Raskin, “Looking at mean-payoff and total-payoff through windows,” vol. 8172. Springer, pp. 118–132, 2013.
LibreCat: https://research-explorer.ista.ac.at/record/2279
DOI: 10.1007/978-3-319-02444-8_10

J. Reiter, I. Bozic, K. Chatterjee, and M. Nowak, TTP: Tool for Tumor Progression. IST Austria, 2013.
LibreCat: https://research-explorer.ista.ac.at/record/5399
DOI: 10.15479/AT:IST-2013-104-v1-1

K. Chatterjee, M. Chmelik, and M. Tracol, “What is decidable about partially observable Markov decision processes with omega-regular objectives,” vol. 23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp. 165–180, 2013.
LibreCat: https://research-explorer.ista.ac.at/record/2295
DOI: 10.4230/LIPIcs.CSL.2013.165

K. Chatterjee and R. Ibsen-Jensen, Qualitative analysis of concurrent mean-payoff games. IST Austria, 2013.
LibreCat: https://research-explorer.ista.ac.at/record/5403
DOI: 10.15479/AT:IST-2013-126-v1-1

K. Chatterjee, M. Chmelik, and M. Tracol, What is decidable about partially observable Markov decision processes with <9-regular objectives. IST Austria, 2013.
LibreCat: https://research-explorer.ista.ac.at/record/5400
DOI: 10.15479/AT:IST-2013-109-v1-1

K. Chatterjee and R. Ibsen-Jensen, The complexity of ergodic games. IST Austria, 2013.
LibreCat: https://research-explorer.ista.ac.at/record/5404
DOI: 10.15479/AT:IST-2013-127-v1-1

K. Chatterjee, L. Doyen, H. Gimbert, and Y. Oualhadj, Perfect-information stochastic mean-payoff parity games. IST Austria, 2013.
LibreCat: https://research-explorer.ista.ac.at/record/5405
DOI: 10.15479/AT:IST-2013-128-v1-1

K. Chatterjee, R. Ibsen-Jensen, and R. Majumdar, Edit distance for timed automata. IST Austria, 2013.
LibreCat: https://research-explorer.ista.ac.at/record/5409
DOI: 10.15479/AT:IST-2013-144-v1-1

K. Chatterjee, T. A. Henzinger, J. Otop, and A. Pavlogiannis, “Distributed synthesis for LTL fragments,” in 13th International Conference on Formal Methods in Computer-Aided Design, Portland, OR, United States, 2013, pp. 18–25.
LibreCat: https://research-explorer.ista.ac.at/record/1376
DOI: 10.1109/FMCAD.2013.6679386

K. Chatterjee, T. A. Henzinger, J. Otop, and A. Pavlogiannis, Distributed synthesis for LTL Fragments. IST Austria, 2013.
LibreCat: https://research-explorer.ista.ac.at/record/5406
DOI: 10.15479/AT:IST-2013-130-v1-1

K. Chatterjee, L. Doyen, S. Nain, and M. Vardi, The complexity of partial-observation stochastic parity games with finite-memory strategies. IST Austria, 2013.
LibreCat: https://research-explorer.ista.ac.at/record/5408
DOI: 10.15479/AT:IST-2013-141-v1-1

U. Ahmed, K. Chatterjee, and S. Gulwani, Automatic generation of alternative starting positions for traditional board games. IST Austria, 2013.
LibreCat: https://research-explorer.ista.ac.at/record/5410
DOI: 10.15479/AT:IST-2013-146-v1-1

K. Chatterjee and Y. Velner, “Hyperplane separation technique for multidimensional mean-payoff games,” vol. 8052. Springer, pp. 500–515, 2013.
LibreCat: https://research-explorer.ista.ac.at/record/2329
DOI: 10.1007/978-3-642-40184-8_35
arXiv: 1210.3141