Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.




332 Publications

2014 | Technical Report | IST-REx-ID: 5418   OA
Chatterjee K, Doyen L. 2014. Games with a weak adversary, IST Austria, 18p.
View | Files available | DOI
 
2014 | Technical Report | IST-REx-ID: 5420   OA
Chatterjee K, Ibsen-Jensen R. 2014. The value 1 problem for concurrent mean-payoff games, IST Austria, 49p.
View | Files available | DOI
 
2014 | Conference Paper | IST-REx-ID: 2054
Chatterjee K. 2014. Qualitative concurrent parity games: Bounded rationality. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). CONCUR: Concurrency Theory, LNCS, vol. 8704. 544–559.
View | Files available | DOI
 
2014 | Conference Paper | IST-REx-ID: 475   OA
Aminof B, Rubin S. 2014. First cycle games. Electronic Proceedings in Theoretical Computer Science, EPTCS. SR: Strategic Reasoning, EPTCS, vol. 146. 83–90.
View | Files available | DOI
 
2014 | Conference Paper | IST-REx-ID: 2213
Chatterjee K, Doyen L, Nain S, Vardi M. 2014. The complexity of partial-observation stochastic parity games with finite-memory strategies. FoSSaCS: Foundations of Software Science and Computation Structures, LNCS, vol. 8412. 242–257.
View | Files available | DOI | Download (ext.) | arXiv
 
2014 | Conference Paper | IST-REx-ID: 2162
Chatterjee K, Ibsen-Jensen R. 2014. The complexity of ergodic mean payoff games. ICST: International Conference on Software Testing, Verification and Validation, LNCS, vol. 8573. 122–133.
View | Files available | DOI | Download (ext.) | arXiv
 
2014 | Technical Report | IST-REx-ID: 5419   OA
Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2014. Improved algorithms for reachability and shortest path on low tree-width graphs, IST Austria, 34p.
View | Files available | DOI
 
2014 | Technical Report | IST-REx-ID: 5414   OA
Chatterjee K, Daca P, Chmelik M. 2014. CEGAR for qualitative analysis of probabilistic systems, IST Austria, 33p.
View | Files available | DOI
 
2014 | Technical Report | IST-REx-ID: 5426   OA
Chatterjee K, Chmelik M, Gupta R, Kanodia A. 2014. Qualitative analysis of POMDPs with temporal logic specifications for robotics applications, IST Austria, 10p.
View | Files available | DOI
 
2014 | Technical Report | IST-REx-ID: 5421
Chatterjee K, Ibsen-Jensen R, Nowak M. 2014. The complexity of evolution on graphs, IST Austria, 27p.
View | Files available | DOI
 
2014 | Journal Article | IST-REx-ID: 2187   OA
Bloem R, Chatterjee K, Greimel K, Henzinger TA, Hofferek G, Jobstmann B, Könighofer B, Könighofer R. 2014. Synthesizing robust systems. Acta Informatica. 51(3–4), 193–220.
View | Files available | DOI
 
2014 | Conference Paper | IST-REx-ID: 2163
Chatterjee K, Doyen L. 2014. Games with a weak adversary. Lecture Notes in Computer Science. ICALP: Automata, Languages and Programming, LNCS, vol. 8573. 110–121.
View | Files available | DOI | Download (ext.) | arXiv
 
2014 | Technical Report | IST-REx-ID: 5427   OA
Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2014. Optimal tree-decomposition balancing and reachability on low treewidth graphs, IST Austria, 24p.
View | Files available | DOI
 
2014 | Technical Report | IST-REx-ID: 5415
Chatterjee K, Henzinger TA, Otop J. 2014. Nested weighted automata, IST Austria, 27p.
View | Files available | DOI
 
2013 | Journal Article | IST-REx-ID: 2816   OA
Božić I, Reiter J, Allen B, Antal T, Chatterjee K, Shah P, Moon Y, Yaqubie A, Kelly N, Le D, Lipson E, Chapman P, Diaz L, Vogelstein B, Nowak M. 2013. Evolutionary dynamics of cancer in response to targeted combination therapy. eLife. 2.
View | Files available | DOI
 
2013 | Journal Article | IST-REx-ID: 2854   OA
Chatterjee K, De Alfaro L, Henzinger TA. 2013. Strategy improvement for concurrent reachability and turn based stochastic safety games. Journal of Computer and System Sciences. 79(5), 640–657.
View | Files available | DOI
 
2013 | Technical Report | IST-REx-ID: 5409   OA
Chatterjee K, Ibsen-Jensen R, Majumdar R. 2013. Edit distance for timed automata, IST Austria, 12p.
View | Files available | DOI
 
2013 | Technical Report | IST-REx-ID: 5404   OA
Chatterjee K, Ibsen-Jensen R. 2013. The complexity of ergodic games, IST Austria, 29p.
View | Files available | DOI
 
2013 | Journal Article | IST-REx-ID: 2247   OA
Zagorsky B, Reiter J, Chatterjee K, Nowak M. 2013. Forgiver triumphs in alternating prisoner’s dilemma . PLoS One. 8(12).
View | Files available | DOI
 
2013 | Conference Paper | IST-REx-ID: 2444   OA
Chatterjee K, Ła̧Cki J. 2013. Faster algorithms for Markov decision processes with low treewidth. 8044, 543–558.
View | DOI | Download (ext.) | arXiv
 
2013 | Conference (Editor) | IST-REx-ID: 2292
Chatterjee K, Sgall J eds. 2013. Mathematical Foundations of Computer Science 2013, Springer,p.
View | DOI
 
2013 | Conference Paper | IST-REx-ID: 2305   OA
Brázdil T, Chatterjee K, Forejt V, Kučera A. 2013. Trading performance for stability in Markov decision processes. 28th Annual ACM/IEEE Symposium. LICS: Logic in Computer Science 331–340.
View | Files available | DOI | Download (ext.) | arXiv
 
2013 | Journal Article | IST-REx-ID: 2824
Chatterjee K, Prabhu V. 2013. Synthesis of memory-efficient, clock-memory free, and non-Zeno safety controllers for timed systems. Information and Computation. 228–229, 83–119.
View | DOI
 
2013 | Journal Article | IST-REx-ID: 2831   OA
Chatterjee K, Henzinger M, Joglekar M, Shah N. 2013. Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives. Formal Methods in System Design. 42(3), 301–327.
View | DOI | Download (ext.) | arXiv
 
2013 | Journal Article | IST-REx-ID: 2836   OA
Chatterjee K, Raman V. 2013. Assume-guarantee synthesis for digital contract signing. Formal Aspects of Computing. 26(4), 825–859.
View | DOI | Download (ext.) | arXiv
 
2013 | Journal Article | IST-REx-ID: 2817   OA
Novak S, Chatterjee K, Nowak M. 2013. Density games. Journal of Theoretical Biology. 334, 26–34.
View | Files available | DOI
 
2013 | Conference Paper | IST-REx-ID: 2886   OA
Chmelik M, Řehák V. 2013. Controllable-choice message sequence graphs. 7721, 118–130.
View | DOI | Download (ext.)
 
2013 | Technical Report | IST-REx-ID: 5400   OA
Chatterjee K, Chmelik M, Tracol M. 2013. What is decidable about partially observable Markov decision processes with ω-regular objectives, IST Austria, 41p.
View | Files available | DOI
 
2013 | Conference Paper | IST-REx-ID: 1376
Chatterjee K, Henzinger TA, Otop J, Pavlogiannis A. 2013. Distributed synthesis for LTL fragments. 13th International Conference on Formal Methods in Computer-Aided Design. FMCAD: Formal Methods in Computer-Aided Design 18–25.
View | Files available | DOI
 
2013 | Technical Report | IST-REx-ID: 5405   OA
Chatterjee K, Doyen L, Gimbert H, Oualhadj Y. 2013. Perfect-information stochastic mean-payoff parity games, IST Austria, 22p.
View | Files available | DOI
 
2013 | Conference Paper | IST-REx-ID: 2329
Chatterjee K, Velner Y. 2013. Hyperplane separation technique for multidimensional mean-payoff games. 8052, 500–515.
View | Files available | DOI | Download (ext.) | arXiv
 
2013 | Conference Paper | IST-REx-ID: 2279
Chatterjee K, Doyen L, Randour M, Raskin J. 2013. Looking at mean-payoff and total-payoff through windows. 8172, 118–132.
View | Files available | DOI | Download (ext.)
 
2013 | Technical Report | IST-REx-ID: 5406   OA
Chatterjee K, Henzinger TA, Otop J, Pavlogiannis A. 2013. Distributed synthesis for LTL Fragments, IST Austria, 11p.
View | Files available | DOI
 
2013 | Conference Paper | IST-REx-ID: 2820
Chatterjee K, Kößler A, Schmid U. 2013. Automated analysis of real-time scheduling using graph games. Proceedings of the 16th International conference on Hybrid systems: Computation and control. HSCC: Hybrid Systems - Computation and Control 163–172.
View | Files available | DOI
 
2013 | Conference Paper | IST-REx-ID: 2446   OA
Chatterjee K, Gaiser A, Kretinsky J. 2013. Automata with generalized Rabin pairs for probabilistic model checking and LTL synthesis. 8044, 559–575.
View | DOI | Download (ext.) | arXiv
 
2013 | Journal Article | IST-REx-ID: 2299   OA
Godhal Y, Chatterjee K, Henzinger TA. 2013. Synthesis of AMBA AHB from formal specification: A case study. International Journal on Software Tools for Technology Transfer. 15(5–6), 585–601.
View | Files available | DOI
 
2013 | Conference Paper | IST-REx-ID: 2819   OA
Chatterjee K, Prabhu V. 2013. Quantitative timed simulation functions and refinement metrics for real-time systems. Proceedings of the 16th International Conference on Hybrid Systems: Computation and Control. HSCC: Hybrid Systems - Computation and Control vol. 1. 273–282.
View | DOI | Download (ext.)
 
2013 | Journal Article | IST-REx-ID: 2814   OA
Chatterjee K, Alfaro L, Majumdar R. 2013. The complexity of coverage. International Journal of Foundations of Computer Science. 24(2), 165–185.
View | DOI | Download (ext.) | arXiv
 
2013 | Technical Report | IST-REx-ID: 5399   OA
Reiter J, Bozic I, Chatterjee K, Nowak M. 2013. TTP: Tool for Tumor Progression, IST Austria, 17p.
View | Files available | DOI
 
2013 | Conference Paper | IST-REx-ID: 1374   OA
Chatterjee K, Fijalkow N. 2013. Infinite-state games with finitary conditions. 22nd EACSL Annual Conference on Computer Science Logic. CSL: Computer Science LogicLeibniz International Proceedings in Informatics, LIPIcs, vol. 23. 181–196.
View | Files available | DOI
 
2013 | Conference Paper | IST-REx-ID: 2238
Chatterjee K, Forejt V, Wojtczak D. 2013. Multi-objective discounted reward verification in graphs and MDPs. 8312, 228–242.
View | DOI
 
2013 | Journal Article | IST-REx-ID: 2858   OA
Reiter J, Božić I, Allen B, Chatterjee K, Nowak M. 2013. The effect of one additional driver mutation on tumor progression. Evolutionary Applications. 6(1), 34–45.
View | Files available | DOI
 
2013 | Journal Article | IST-REx-ID: 3116
Chatterjee K, De Alfaro L, Faella M, Majumdar R, Raman V. 2013. Code aware resource management. Formal Methods in System Design. 42(2), 142–174.
View | DOI
 
2013 | Conference Paper | IST-REx-ID: 2295
Chatterjee K, Chmelik M, Tracol M. 2013. What is decidable about partially observable Markov decision processes with omega-regular objectives. 23, 165–180.
View | Files available | DOI
 
2013 | Technical Report | IST-REx-ID: 5403   OA
Chatterjee K, Ibsen-Jensen R. 2013. Qualitative analysis of concurrent mean-payoff games, IST Austria, 33p.
View | Files available | DOI
 
2013 | Conference Paper | IST-REx-ID: 2000
Reiter J, Božić I, Chatterjee K, Nowak M. 2013. TTP: Tool for tumor progression. Proceedings of 25th Int. Conf. on Computer Aided Verification. CAV: Computer Aided VerificationLecture Notes in Computer Science, LNCS, vol. 8044. 101–106.
View | Files available | DOI | Download (ext.) | arXiv
 
2013 | Technical Report | IST-REx-ID: 5410   OA
Ahmed U, Chatterjee K, Gulwani S. 2013. Automatic generation of alternative starting positions for traditional board games, IST Austria, 13p.
View | Files available | DOI
 
2013 | Technical Report | IST-REx-ID: 5408   OA
Chatterjee K, Doyen L, Nain S, Vardi M. 2013. The complexity of partial-observation stochastic parity games with finite-memory strategies, IST Austria, 17p.
View | Files available | DOI
 
2012 | Conference Paper | IST-REx-ID: 2715   OA
Chatterjee K, Joglekar M, Shah N. 2012. Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, LIPIcs, vol. 18. 461–473.
View | Files available | DOI
 
2012 | Conference Paper | IST-REx-ID: 2936   OA
Chatterjee K, Henzinger TA, Prabhu V. 2012. Finite automata with time delay blocks. roceedings of the tenth ACM international conference on Embedded software. EMSOFT: Embedded Software 43–52.
View | DOI | Download (ext.)
 
2012 | Journal Article | IST-REx-ID: 3314
Chatterjee K, Majumdar R. 2012. Discounting and averaging in games across time scales. International Journal of Foundations of Computer Science. 23(3), 609–625.
View | DOI
 
2012 | Conference Paper | IST-REx-ID: 496   OA
Rabinovich A, Rubin S. 2012. Interpretations in trees with countably many branches. LICS: Symposium on Logic in Computer Science, LICS,
View | DOI | Download (ext.)
 
2012 | Conference Paper | IST-REx-ID: 2955
Chatterjee K, Doyen L. 2012. Partial-observation stochastic games: How to win when belief fails. Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Logic in Computer Science 6280436.
View | Files available | DOI | Download (ext.) | arXiv
 
2012 | Technical Report | IST-REx-ID: 5377   OA
Chatterjee K, Velner Y. 2012. Mean-payoff pushdown games, IST Austria, 33p.
View | Files available | DOI
 
2012 | Journal Article | IST-REx-ID: 2848   OA
Chatterjee K, Zufferey D, Nowak M. 2012. Evolutionary game dynamics in populations with different learners. Journal of Theoretical Biology. 301, 161–173.
View | DOI | Download (ext.) | PubMed | Europe PMC
 
2012 | Conference Paper | IST-REx-ID: 3252   OA
Chatterjee K, Raman V. 2012. Synthesizing protocols for digital contract signing. VMCAI: Verification, Model Checking and Abstract Interpretation, LNCS, vol. 7148. 152–168.
View | DOI | Download (ext.)
 
2012 | Journal Article | IST-REx-ID: 3846   OA
Chatterjee K, Henzinger TA. 2012. A survey of stochastic ω regular games. Journal of Computer and System Sciences. 78(2), 394–413.
View | Files available | DOI
 
2012 | Conference Paper | IST-REx-ID: 497
Chatterjee K, Chaubal S, Kamath P. 2012. Faster algorithms for alternating refinement relations. EACSL: European Association for Computer Science Logic, LIPIcs, vol. 16. 167–182.
View | Files available | DOI
 
2012 | Conference Paper | IST-REx-ID: 2956
Chatterjee K, Velner Y. 2012. Mean payoff pushdown games. Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Logic in Computer Science 6280438.
View | Files available | DOI
 
2012 | Technical Report | IST-REx-ID: 5378   OA
Chatterjee K, Chaubal S, Kamath P. 2012. Faster algorithms for alternating refinement relations, IST Austria, 21p.
View | Files available | DOI
 
2012 | Conference Paper | IST-REx-ID: 3341
Chatterjee K. 2012. Robustness of structurally equivalent concurrent parity games. FoSSaCS: Foundations of Software Science and Computation Structures, LNCS, vol. 7213. 270–285.
View | Files available | DOI | Download (ext.) | arXiv
 
2012 | Journal Article | IST-REx-ID: 3157   OA
Diaz Jr L, Williams R, Wu J, Kinde I, Hecht J, Berlin J, Allen B, Božić I, Reiter J, Nowak M, Kinzler K, Oliner K, Vogelstein B. 2012. The molecular evolution of acquired resistance to targeted EGFR blockade in colorectal cancers. Nature. 486(7404), 537–540.
View | Files available | DOI | Download (ext.) | PubMed | Europe PMC
 
2012 | Journal Article | IST-REx-ID: 3260   OA
Chatterjee K, Reiter J, Nowak M. 2012. Evolutionary dynamics of biological auctions. Theoretical Population Biology. 81(1), 69–80.
View | Files available | DOI | Download (ext.) | PubMed | Europe PMC
 
2012 | Conference Paper | IST-REx-ID: 2957
Chatterjee K, Tracol M. 2012. Decidable problems for probabilistic automata on infinite words. Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Logic in Computer Science 6280437.
View | Files available | DOI | Download (ext.) | arXiv
 
2012 | Journal Article | IST-REx-ID: 3254
Chatterjee K. 2012. The complexity of stochastic Müller games. Information and Computation. 211, 29–48.
View | DOI | Download (ext.)
 
2012 | Journal Article | IST-REx-ID: 2972
Chatterjee K, Doyen L. 2012. Energy parity games. Theoretical Computer Science. 458, 49–60.
View | Files available | DOI | arXiv
 
2012 | Conference Paper | IST-REx-ID: 3165
Chatterjee K, Henzinger M. 2012. An O(n2) time algorithm for alternating Büchi games. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms 1386–1399.
View | Files available | DOI
 
2012 | Conference Paper | IST-REx-ID: 2947   OA
Chatterjee K, Chmelik M, Majumdar R. 2012. Equivalence of games with probabilistic uncertainty and partial observation games. ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 7561. 385–399.
View | DOI | Download (ext.)
 
2012 | Conference Paper | IST-REx-ID: 2916   OA
Cerny P, Chmelik M, Henzinger TA, Radhakrishna A. 2012. Interface Simulation Distances. Electronic Proceedings in Theoretical Computer Science. GandALF: Games, Automata, Logic, and Formal Verification vol. 96. 29–42.
View | Files available | DOI | Download (ext.) | arXiv
 
2012 | Journal Article | IST-REx-ID: 3128   OA
Chatterjee K, Doyen L, Henzinger TA. 2012. A survey of partial-observation stochastic parity games. Formal Methods in System Design. 43(2), 268–284.
View | Files available | DOI
 
2012 | Conference Paper | IST-REx-ID: 3135   OA
Brázdil B, Chatterjee K, Kučera A, Novotny P. 2012. Efficient controller synthesis for consumption games with multiple resource types. CAV: Computer Aided Verification, LNCS, vol. 7358. 23–38.
View | DOI | Download (ext.)
 
2012 | Conference Paper | IST-REx-ID: 3255
Chatterjee K, Doyen L. 2012. Games and Markov decision processes with mean payoff parity and energy parity objectives. MEMICS: Mathematical and Engineering Methods in Computer Science, LNCS, vol. 7119. 37–46.
View | DOI
 
2012 | Conference Paper | IST-REx-ID: 495   OA
Kruckman A, Rubin S, Sheridan J, Zax B. 2012. A Myhill Nerode theorem for automata with advice. Proceedings GandALF 2012. GandALF: Games, Automata, Logics and Formal Verification, EPTCS, vol. 96. 238–246.
View | Files available | DOI
 
2011 | Conference Paper | IST-REx-ID: 3357
Chatterjee K, Henzinger TA, Horn F. 2011. The complexity of request-response games. LATA: Language and Automata Theory and Applications, LNCS, vol. 6638. 227–237.
View | DOI
 
2011 | Conference Paper | IST-REx-ID: 3345
Chatterjee K, Doyen L. 2011. Energy and mean-payoff parity Markov Decision Processes. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 6907. 206–218.
View | Files available | DOI | Download (ext.) | arXiv
 
2011 | Technical Report | IST-REx-ID: 5384   OA
Chatterjee K, Tracol M. 2011. Decidable problems for probabilistic automata on infinite words, IST Austria, 30p.
View | Files available | DOI
 
2011 | Preprint | IST-REx-ID: 3338
Chatterjee K. 2011. Bounded rationality in concurrent parity games. arXiv., 1–51.
View | Files available | Download (ext.) | arXiv
 
2011 | Preprint | IST-REx-ID: 3339   OA
Chatterjee K, De Alfaro L, Pritam R. 2011. Magnifying lens abstraction for stochastic games with discounted and long-run average objectives. arXiv.
View | Download (ext.) | arXiv
 
2011 | Journal Article | IST-REx-ID: 3315   OA
Chatterjee K, Henzinger TA, Prabhu V. 2011. Timed parity games: Complexity and robustness. Logical Methods in Computer Science. 7(4).
View | Files available | DOI
 
2011 | Conference Paper | IST-REx-ID: 3346   OA
Brázdil T, Brožek V, Chatterjee K, Forejt V, Kučera A. 2011. Two views on multiple mean payoff objectives in Markov Decision Processes. LICS: Logic in Computer Science
View | DOI | Download (ext.)
 
2011 | Conference Paper | IST-REx-ID: 3365   OA
Chatterjee K, Henzinger TA, Jobstmann B, Singh R. 2011. QUASY: quantitative synthesis tool. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 6605. 267–271.
View | Files available | DOI
 
2011 | Technical Report | IST-REx-ID: 5380   OA
Chatterjee K. 2011. Bounded rationality in concurrent parity games, IST Austria, 53p.
View | Files available | DOI
 
2011 | Technical Report | IST-REx-ID: 5385   OA
Boker U, Chatterjee K, Henzinger TA, Kupferman O. 2011. Temporal specifications with accumulative values, IST Austria, 14p.
View | Files available | DOI
 
2011 | Conference Paper | IST-REx-ID: 3361   OA
Cerny P, Chatterjee K, Henzinger TA. 2011. The complexity of quantitative information flow problems. CSF: Computer Security Foundations 205–217.
View | Files available | DOI
 
2011 | Conference Paper | IST-REx-ID: 3342   OA
Chatterjee K, Henzinger M, Joglekar M, Nisarg S. 2011. Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives. CAV: Computer Aided Verification, LNCS, vol. 6806. 260–276.
View | DOI | Download (ext.) | arXiv
 
2011 | Conference Paper | IST-REx-ID: 3347   OA
Chatterjee K, Fijalkow N. 2011. Finitary languages. LATA: Language and Automata Theory and Applications, LNCS, vol. 6638. 216–226.
View | DOI | Download (ext.) | arXiv
 
2011 | Journal Article | IST-REx-ID: 3354
Chatterjee K, De Alfaro L, Henzinger TA. 2011. Qualitative concurrent parity games. ACM Transactions on Computational Logic (TOCL). 12(4).
View | Files available | DOI
 
2011 | Conference Paper | IST-REx-ID: 3316
Bloem R, Chatterjee K, Greimel K, Henzinger TA, Jobstmann B. 2011. Specification-centered robustness. 6th IEEE International Symposium on Industrial and Embedded Systems. SIES: International Symposium on Industrial Embedded Systems 176–185.
View | DOI
 
2011 | Technical Report | IST-REx-ID: 5381   OA
Chatterjee K, Doyen L. 2011. Partial-observation stochastic games: How to win when belief fails, IST Austria, 43p.
View | Files available | DOI
 
2011 | Technical Report | IST-REx-ID: 5379   OA
Chatterjee K, Henzinger M. 2011. An O(n2) time algorithm for alternating Büchi games, IST Austria, 20p.
View | Files available | DOI
 
2011 | Conference Paper | IST-REx-ID: 3366
Cerny P, Chatterjee K, Henzinger TA, Radhakrishna A, Singh R. 2011. Quantitative synthesis for concurrent programs. CAV: Computer Aided Verification, LNCS, vol. 6806. 243–259.
View | Files available | DOI
 
2011 | Conference Paper | IST-REx-ID: 3343   OA
Chatterjee K, Henzinger M. 2011. Faster and dynamic algorithms for maximal end component decomposition and related graph problems in probabilistic verification. SODA: Symposium on Discrete Algorithms 1318–1336.
View | DOI | Download (ext.)
 
2011 | Conference Paper | IST-REx-ID: 3348   OA
Chatterjee K, Prabhu V. 2011. Synthesis of memory efficient real time controllers for safety objectives. HSCC: Hybrid Systems - Computation and Control 221–230.
View | DOI | Download (ext.)
 
2011 | Conference Paper | IST-REx-ID: 3350
Chatterjee K, Majumdar R. 2011. Minimum attention controller synthesis for omega regular objectives. FORMATS: Formal Modeling and Analysis of Timed Systems, LNCS, vol. 6919. 145–159.
View | DOI
 
2011 | Technical Report | IST-REx-ID: 5382   OA
Chatterjee K. 2011. Robustness of structurally equivalent concurrent parity games, IST Austria, 18p.
View | Files available | DOI
 
2011 | Technical Report | IST-REx-ID: 5387   OA
Chatterjee K, Doyen L. 2011. Energy and mean-payoff parity Markov decision processes, IST Austria, 20p.
View | Files available | DOI
 
2011 | Preprint | IST-REx-ID: 3363   OA
Chatterjee K, Henzinger TA, Tracol M. The decidability frontier for probabilistic automata on infinite words.
View | Download (ext.) | arXiv
 
2011 | Conference Paper | IST-REx-ID: 3349   OA
Chatterjee K, Fijalkow N. 2011. A reduction from parity games to simple stochastic games. GandALF: Games, Automata, Logic, and Formal Verification, EPTCS, vol. 54. 74–86.
View | DOI | Download (ext.)
 
2011 | Conference Paper | IST-REx-ID: 3351   OA
Chatterjee K, Doyen L, Singh R. 2011. On memoryless quantitative objectives. FCT: Fundamentals of Computation Theory, LNCS, vol. 6914. 148–159.
View | DOI | Download (ext.)
 
2011 | Conference Paper | IST-REx-ID: 3344
Chatterjee K. 2011. Graph games with reachability objectives. RP: Reachability Problems, LNCS, vol. 6945. 1–1.
View | DOI
 

Search

Filter Publications

Display / Sort

Citation Style: IST Annual Report

Export / Embed