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