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.

340 Publications


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

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

2011 | Technical Report | IST-REx-ID: 5384
Chatterjee K, Tracol M. 2011. Decidable problems for probabilistic automata on infinite words, IST Austria, 30p.
View | Files available | 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 (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 | 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 | Journal Article | IST-REx-ID: 3315
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 | Technical Report | IST-REx-ID: 5380   OA
Chatterjee K. 2011. Bounded rationality in concurrent parity games, IST Austria, 53p.
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 | 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: 5381
Chatterjee K, Doyen L. 2011. Partial-observation stochastic games: How to win when belief fails, IST Austria, 43p.
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 | 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
 

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

2011 | Technical Report | IST-REx-ID: 5379
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: 3342
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 (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 (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
Chatterjee K. 2011. Robustness of structurally equivalent concurrent parity games, IST Austria, 18p.
View | Files available | DOI
 

2011 | Technical Report | IST-REx-ID: 5387
Chatterjee K, Doyen L. 2011. Energy and mean-payoff parity Markov decision processes, IST Austria, 20p.
View | Files available | DOI
 

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 | 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: 3356
Boker U, Chatterjee K, Henzinger TA, Kupferman O. 2011. Temporal specifications with accumulative values. LICS: Logic in Computer Science
View | Files available | DOI
 

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

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: 3858
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 | 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 | 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 | 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 (Editor) | IST-REx-ID: 3859
Chatterjee K, Henzinger TA eds. 2010. Formal modeling and analysis of timed systems, Springer,p.
View | Files available | DOI
 

Filters and Search Terms

department=KrCh

Search

Filter Publications

Display / Sort

Citation Style: IST Annual Report

Export / Embed