Chatterjee, Krishnendu, et al. Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components. IST Austria, 2015, doi:10.15479/AT:IST-2015-340-v1-1.

Svoreová, Mária, et al. “Temporal Logic Control for Stochastic Linear Systems Using Abstraction Refinement of Probabilistic Games.”10.1145/2728606.2728608__Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control, ACM, 2015, pp. 259–68, doi:10.1145/2728606.2728608.

Priklopil, Tadeas, and Krishnendu Chatterjee. “Evolution of Decisions in Population Games with Sequentially Searching Individuals.”10.3390/g6040413__Games, vol. 6, no. 4, MDPI, 2015, pp. 413–37, doi:10.3390/g6040413.

Brázdil, Tomás, et al. Counterexample Explanation by Learning Small Strategies in Markov Decision Processes. Vol. 9206, Springer, 2015, pp. 158–77, doi:10.1007/978-3-319-21690-4_10.

Fellner, Andreas. Experimental Part of CAV 2015 Publication: Counterexample Explanation by Learning Small Strategies in Markov Decision Processes. Institute of Science and Technology Austria, 2015, doi:10.15479/AT:ISTA:28.

Aminof, Benjamin, et al. “Parameterized Model Checking of Token-Passing Systems.”10.1007/978-3-642-54013-4_15__Verification, Model Checking, and Abstract Interpretation, vol. 8318, Springer Nature, 2014, pp. 262–81, doi:10.1007/978-3-642-54013-4_15.

Chatterjee, Krishnendu, et al. “Approximating the Minimum Cycle Mean.”10.1016/j.tcs.2014.06.031__Theoretical Computer Science, vol. 547, no. C, Elsevier, 2014, pp. 104–16, doi:10.1016/j.tcs.2014.06.031.

Jha, Susmit, et al. Game Theoretic Secure Localization in Wireless Sensor Networks. IEEE, 2014, pp. 85–90, doi:10.1109/IOT.2014.7030120.

Landau, Dan, 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, 2014, pp. 1952–1952.

Brázdil, Tomás, et al. “Verification of Markov Decision Processes Using Learning Algorithms.”10.1007/978-3-319-11936-6_8__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, vol. 8837, Society of Industrial and Applied Mathematics, 2014, pp. 98–114, doi:10.1007/978-3-319-11936-6_8.

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

Aminof, Benjamin, et al. “Parameterized Model Checking of Rendezvous Systems.”10.1007/978-3-662-44584-6_9__Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), edited by Paolo Baldan and Daniele Gorla, vol. 8704, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014, pp. 109–24, doi:10.1007/978-3-662-44584-6_9.

Bloem, Roderick, et al. “Synthesizing Robust Systems.”10.1007/s00236-013-0191-5__Acta Informatica, vol. 51, no. 3–4, Springer, 2014, pp. 193–220, doi:10.1007/s00236-013-0191-5.

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

Brázdil, Tomás, et al. “Markov Decision Processes with Multiple Long-Run Average Objectives.”10.2168/LMCS-10(1:13)2014__Logical Methods in Computer Science, vol. 10, no. 1, International Federation of Computational Logic, 2014, doi:10.2168/LMCS-10(1:13)2014.

Grinshpun, Andrey, et al. “Alternating Traps in Muller and Parity Games.”10.1016/j.tcs.2013.11.032__Theoretical Computer Science, vol. 521, Elsevier, 2014, pp. 73–91, doi:10.1016/j.tcs.2013.11.032.

Chatterjee, Krishnendu, et al. “Strategy Synthesis for Multi-Dimensional Quantitative Objectives.”10.1007/s00236-013-0182-6__Acta Informatica, vol. 51, no. 3–4, Springer, 2014, pp. 129–63, doi:10.1007/s00236-013-0182-6.

Cerny, Pavol, et al. “Interface Simulation Distances.”10.1016/j.tcs.2014.08.019__Theoretical Computer Science, vol. 560, no. 3, Elsevier, 2014, pp. 348–63, doi: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.”10.1145/2597631__Journal of the ACM, vol. 61, no. 3, , ACM, 2014, doi:10.1145/2597631.

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