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.

341 Publications


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: 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: 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: 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 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
 

2010 | Journal Article | IST-REx-ID: 3861
Chatterjee K, Henzinger TA, Piterman N. 2010. Strategy logic. Information and Computation. 208(6), 677–693.
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
 

2010 | Journal Article | IST-REx-ID: 3867
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 | Conference Paper | IST-REx-ID: 3855
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 | 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 | Journal Article | IST-REx-ID: 3863
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 | 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: 3856
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 (ext.)
 

2010 | Conference Paper | IST-REx-ID: 3851
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 (ext.) | arXiv
 

2010 | Technical Report | IST-REx-ID: 5388
Chatterjee K, Cerny P, Henzinger TA, Radhakrishna A, Singh R. 2010. Quantitative synthesis for concurrent programs, IST Austria, 17p.
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: 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 (ext.) | 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 | 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 | Technical Report | IST-REx-ID: 5393
Chatterjee K, Henzinger TA, Jobstmann B, Radhakrishna A. 2009. Gist: A solver for probabilistic games, IST Austria, 12p.
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 | 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 | 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 | 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
 

Filters and Search Terms

department=KrCh

Search

Filter Publications

Display / Sort

Citation Style: IST Annual Report

Export / Embed