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

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

359 Publications


2012 | Conference Paper | IST-REx-ID: 2955 | OA
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 Preprint (ext.) | arXiv
 

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 | Conference Paper | IST-REx-ID: 2957 | OA
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 Preprint (ext.) | arXiv
 

2012 | Journal Article | IST-REx-ID: 2972 | OA
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: 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
 

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, , 6280474.
View | DOI | Download Preprint (ext.)
 

2012 | Conference Paper | IST-REx-ID: 497 | OA
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 | Technical Report | IST-REx-ID: 5377 | OA
Chatterjee K, Velner Y. 2012. Mean-payoff pushdown games, IST Austria, 33p.
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 | 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 | 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, Novotný P. 2012. Efficient controller synthesis for consumption games with multiple resource types. CAV: Computer Aided Verification, LNCS, vol. 7358, 23–38.
View | DOI | Download Preprint (ext.)
 

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 Submitted Version (ext.) | PubMed | Europe PMC
 

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: 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 Preprint (ext.)
 

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 None (ext.)
 

2012 | Conference Paper | IST-REx-ID: 3255 | OA
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 | Files available | DOI
 

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 Submitted Version (ext.) | PubMed | Europe PMC
 

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: 3341 | OA
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 Preprint (ext.) | arXiv
 

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 | 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: 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: 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: 5384 | OA
Chatterjee K, Tracol M. 2011. Decidable problems for probabilistic automata on infinite words, IST Austria, 30p.
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 | 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 | 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: 3316 | OA
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 | Download Published Version (ext.)
 

2011 | Preprint | IST-REx-ID: 3338 | OA
Chatterjee K. 2011. Bounded rationality in concurrent parity games. arXiv, 1–51, .
View | Files available | Download Preprint (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 Preprint (ext.) | arXiv
 

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 | Files available | DOI | Download Preprint (ext.) | arXiv
 

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 Submitted Version (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
 

2011 | Conference Paper | IST-REx-ID: 3345 | OA
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 Preprint (ext.) | arXiv
 

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, 5970225.
View | DOI | Download Submitted Version (ext.)
 

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 Preprint (ext.) | arXiv
 

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 Submitted Version (ext.)
 

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 Submitted Version (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 | 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 Submitted Version (ext.)
 

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), 28.
View | Files available | DOI
 

2011 | Conference Paper | IST-REx-ID: 3356 | OA
Boker U, Chatterjee K, Henzinger TA, Kupferman O. 2011. Temporal specifications with accumulative values. LICS: Logic in Computer Science, 5970226.
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: 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 | Preprint | IST-REx-ID: 3363 | OA
Chatterjee K, Henzinger TA, Tracol M. The decidability frontier for probabilistic automata on infinite words.
View | Download Preprint (ext.) | arXiv
 

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 | Conference Paper | IST-REx-ID: 3366 | OA
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
 

2010 | Conference Paper | IST-REx-ID: 489 | OA
Cristau J, David C, Horn F. 2010. How do we remember the past in randomised strategies? . Proceedings of GandALF 2010. GandALF: Games, Automata, Logic, and Formal Verification, EPTCS, vol. 25, 30–39.
View | DOI | Download Published Version (ext.)
 

2010 | Technical Report | IST-REx-ID: 5388 | OA
Chatterjee K, Cerny P, Henzinger TA, Radhakrishna A, Singh R. 2010. Quantitative synthesis for concurrent programs, IST Austria, 17p.
View | Files available | DOI
 

2010 | Technical Report | IST-REx-ID: 5390 | OA
Chatterjee K, Fijalkow N. 2010. Topological, automata-theoretic and logical characterization of finitary languages, IST Austria, 21p.
View | Files available | DOI
 

2010 | Conference Paper | IST-REx-ID: 3851 | OA
Chatterjee K, Doyen L. 2010. Energy parity games. ICALP: Automata, Languages and Programming, 37th International Colloquium, LNCS, vol. 6199, 599–610.
View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2010 | Conference Paper | IST-REx-ID: 3852 | OA
Chatterjee K, Majumdar R. 2010. Discounting in games across time scales. GandALF: Games, Automata, Logic, and Formal Verification, EPTCS, vol. 25, 22–29.
View | Files available | DOI | arXiv
 

2010 | Conference Paper | IST-REx-ID: 3853 | OA
Chatterjee K, Doyen L, Edelsbrunner H, Henzinger TA, Rannou P. 2010. Mean-payoff automaton expressions. CONCUR: Concurrency Theory, LNCS, vol. 6269, 269–283.
View | Files available | DOI
 

2010 | Conference Paper | IST-REx-ID: 3854
Chatterjee K, Horn F, Löding C. 2010. Obliging games. CONCUR: Concurrency Theory, LNCS, vol. 6269, 284–296.
View | DOI
 

2010 | Conference Paper | IST-REx-ID: 3855 | OA
Chatterjee K, Doyen L, Henzinger TA. 2010. Qualitative analysis of partially-observable Markov Decision Processes. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 6281, 258–269.
View | Files available | DOI
 

2010 | Conference Paper | IST-REx-ID: 3856 | OA
Chatterjee K, Doyen L, Gimbert H, Henzinger TA. 2010. Randomness for free. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 6281, 246–257.
View | Files available | DOI | Download Preprint (ext.)
 

2010 | Conference Paper | IST-REx-ID: 3857
Chatterjee K, Henzinger TA. 2010. Probabilistic Automata on infinite words: decidability and undecidability results. ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 6252, 1–16.
View | Files available | DOI
 

2010 | Conference Paper | IST-REx-ID: 3858 | OA
Chatterjee K, Doyen L. 2010. The complexity of partial-observation parity games. LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, LNCS, vol. 6397, 1–14.
View | Files available | DOI
 

2010 | Conference (Editor) | IST-REx-ID: 3859
Chatterjee K, Henzinger TA eds. 2010. Formal modeling and analysis of timed systems, Springer,p.
View | Files available | DOI
 

2010 | Conference Paper | IST-REx-ID: 3860 | OA
Chatterjee K, Doyen L, Henzinger TA, Raskin J. 2010. Generalized mean-payoff and energy games. FSTTCS: Foundations of Software Technology and Theoretical Computer Science, LIPIcs, vol. 8, 505–516.
View | Files available | DOI
 

2010 | Journal Article | IST-REx-ID: 3861 | OA
Chatterjee K, Henzinger TA, Piterman N. 2010. Strategy logic. Information and Computation. 208(6), 677–693.
View | Files available | DOI
 

2010 | Journal Article | IST-REx-ID: 3863 | OA
Berwanger D, Chatterjee K, De Wulf M, Doyen L, Henzinger TA. 2010. Strategy construction for parity games with imperfect information. Information and Computation. 208(10), 1206–1220.
View | Files available | DOI
 

2010 | Conference Paper | IST-REx-ID: 3864 | OA
Chatterjee K, Henzinger TA, Jobstmann B, Singh R. 2010. Measuring and synthesizing systems in probabilistic environments. CAV: Computer Aided Verification, LNCS, vol. 6174, 380–395.
View | Files available | DOI | Download Preprint (ext.)
 

2010 | Conference Paper | IST-REx-ID: 3865
Chatterjee K, De Alfaro L, Raman V, Sánchez C. 2010. Analyzing the impact of change in multi-threaded programs. FASE: Fundamental Approaches To Software Engineering, LNCS, vol. 6013, 293–307.
View | DOI
 

2010 | Conference Paper | IST-REx-ID: 3866 | OA
Bloem R, Chatterjee K, Greimel K, Henzinger TA, Jobstmann B. 2010. Robustness in the presence of liveness. CAV: Computer Aided Verification, LNCS, vol. 6174, 410–424.
View | Files available | DOI
 

2010 | Journal Article | IST-REx-ID: 3867 | OA
Chatterjee K, Doyen L, Henzinger TA. 2010. Expressiveness and closure properties for quantitative languages. Logical Methods in Computer Science. 6(3), 1–23.
View | Files available | DOI
 

2010 | Journal Article | IST-REx-ID: 3868 | OA
Chatterjee K, De Alfaro L, Majumdar R, Raman V. 2010. Algorithms for game metrics. Logical Methods in Computer Science. 6(3), 1–27.
View | Files available | DOI
 

2010 | Conference Paper | IST-REx-ID: 4388 | OA
Chatterjee K, Henzinger TA, Jobstmann B, Radhakrishna A. 2010. GIST: A solver for probabilistic games. CAV: Computer Aided Verification, LNCS, vol. 6174, 665–669.
View | Files available | DOI | arXiv
 

2009 | Technical Report | IST-REx-ID: 5392 | OA
Chatterjee K. 2009. Probabilistic automata on infinite words: Decidability and undecidability results, IST Austria, 17p.
View | Files available | DOI
 

2009 | Technical Report | IST-REx-ID: 5393 | OA
Chatterjee K, Henzinger TA, Jobstmann B, Radhakrishna A. 2009. Gist: A solver for probabilistic games, IST Austria, 12p.
View | Files available | DOI
 

2009 | Technical Report | IST-REx-ID: 5394 | OA
Chatterjee K, Henzinger TA, Horn F. 2009. Improved lower bounds for request-response and finitary Streett games, IST Austria, 11p.
View | Files available | DOI
 

2009 | Technical Report | IST-REx-ID: 5395 | OA
Chatterjee K, Doyen L, Henzinger TA. 2009. Qualitative analysis of partially-observable Markov decision processes, IST Austria, 20p.
View | Files available | DOI
 

2009 | Journal Article | IST-REx-ID: 3870 | OA
Chatterjee K, Henzinger TA, Horn F. 2009. Finitary winning in omega-regular games. ACM Transactions on Computational Logic (TOCL). 11(1), 1.
View | Files available | DOI
 

2009 | Conference Paper | IST-REx-ID: 3871 | OA
Chatterjee K, Doyen L, Henzinger TA. 2009. Probabilistic weighted automata. CONCUR: Concurrency Theory, LNCS, vol. 5710, 244–258.
View | Files available | DOI
 

2009 | Conference Paper | IST-REx-ID: 4542 | OA
Chatterjee K, Doyen L, Henzinger TA. 2009. Alternating weighted automata. FCT: Fundamentals of Computation Theory, LNCS, vol. 5699, 3–13.
View | Files available | DOI
 

2009 | Conference Paper | IST-REx-ID: 4543
Chatterjee K, Henzinger TA, Horn F. 2009. Stochastic games with finitary objectives. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 5734, 34–54.
View | DOI
 

2009 | Conference Paper | IST-REx-ID: 4545 | OA
Chatterjee K, Doyen L, Henzinger TA. 2009. A survey of stochastic games with limsup and liminf objectives. ICALP: Automata, Languages and Programming, LNCS, vol. 5556, 1–15.
View | Files available | DOI
 

2009 | Conference Paper | IST-REx-ID: 4569 | OA
Bloem R, Chatterjee K, Henzinger TA, Jobstmann B. 2009. Better quality in synthesis through quantitative objectives. CAV: Computer Aided Verification, LNCS, vol. 5643, 140–156.
View | DOI | Download Preprint (ext.) | arXiv
 

Filters and Search Terms

department=KrCh

Search

Filter Publications