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.

363 Publications


2011 | Conference Paper | IST-REx-ID: 3347 | OA
K. Chatterjee and N. Fijalkow, “Finitary languages,” presented at the LATA: Language and Automata Theory and Applications, Tarragona, Spain, 2011, vol. 6638, pp. 216–226.
View | DOI | Download Preprint (ext.) | arXiv
 

2011 | Conference Paper | IST-REx-ID: 3348 | OA
K. Chatterjee and V. Prabhu, “Synthesis of memory efficient real time controllers for safety objectives,” presented at the HSCC: Hybrid Systems - Computation and Control, Chicago, USA, 2011, pp. 221–230.
View | DOI | Download Submitted Version (ext.)
 

2011 | Conference Paper | IST-REx-ID: 3349 | OA
K. Chatterjee and N. Fijalkow, “A reduction from parity games to simple stochastic games,” presented at the GandALF: Games, Automata, Logic, and Formal Verification, Minori, Italy, 2011, vol. 54, pp. 74–86.
View | DOI | Download Submitted Version (ext.)
 

2011 | Conference Paper | IST-REx-ID: 3350
K. Chatterjee and R. Majumdar, “Minimum attention controller synthesis for omega regular objectives,” presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Aalborg, Denmark, 2011, vol. 6919, pp. 145–159.
View | DOI
 

2011 | Conference Paper | IST-REx-ID: 3351 | OA
K. Chatterjee, L. Doyen, and R. Singh, “On memoryless quantitative objectives,” presented at the FCT: Fundamentals of Computation Theory, Oslo, Norway, 2011, vol. 6914, pp. 148–159.
View | DOI | Download Submitted Version (ext.)
 

2011 | Journal Article | IST-REx-ID: 3354
K. Chatterjee, L. De Alfaro, and T. A. Henzinger, “Qualitative concurrent parity games,” ACM Transactions on Computational Logic (TOCL), vol. 12, no. 4. ACM, 2011.
View | Files available | DOI
 

2011 | Conference Paper | IST-REx-ID: 3356 | OA
U. Boker, K. Chatterjee, T. A. Henzinger, and O. Kupferman, “Temporal specifications with accumulative values,” presented at the LICS: Logic in Computer Science, Toronto, Canada, 2011.
View | Files available | DOI
 

2011 | Conference Paper | IST-REx-ID: 3357
K. Chatterjee, T. A. Henzinger, and F. Horn, “The complexity of request-response games,” presented at the LATA: Language and Automata Theory and Applications, Tarragona, Spain, 2011, vol. 6638, pp. 227–237.
View | DOI
 

2011 | Conference Paper | IST-REx-ID: 3361 | OA
P. Cerny, K. Chatterjee, and T. A. Henzinger, “The complexity of quantitative information flow problems,” presented at the CSF: Computer Security Foundations, Cernay-la-Ville, France, 2011, pp. 205–217.
View | Files available | DOI
 

2011 | Preprint | IST-REx-ID: 3363 | OA
K. Chatterjee, T. A. Henzinger, and M. Tracol, “The decidability frontier for probabilistic automata on infinite words.” ArXiv.
View | Download Preprint (ext.) | arXiv
 

2011 | Conference Paper | IST-REx-ID: 3365 | OA
K. Chatterjee, T. A. Henzinger, B. Jobstmann, and R. Singh, “QUASY: quantitative synthesis tool,” presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Saarbrucken, Germany, 2011, vol. 6605, pp. 267–271.
View | Files available | DOI
 

2011 | Conference Paper | IST-REx-ID: 3366 | OA
P. Cerny, K. Chatterjee, T. A. Henzinger, A. Radhakrishna, and R. Singh, “Quantitative synthesis for concurrent programs,” presented at the CAV: Computer Aided Verification, Snowbird, USA, 2011, vol. 6806, pp. 243–259.
View | Files available | DOI
 

2010 | Conference Paper | IST-REx-ID: 489 | OA
J. Cristau, C. David, and F. Horn, “How do we remember the past in randomised strategies? ,” in Proceedings of GandALF 2010, Minori, Amalfi Coast, Italy, 2010, vol. 25, pp. 30–39.
View | DOI | Download Published Version (ext.)
 

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

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

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

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

2010 | Conference Paper | IST-REx-ID: 3853 | OA
K. Chatterjee, L. Doyen, H. Edelsbrunner, T. A. Henzinger, and P. Rannou, “Mean-payoff automaton expressions,” presented at the CONCUR: Concurrency Theory, Paris, France, 2010, vol. 6269, pp. 269–283.
View | Files available | DOI
 

2010 | Conference Paper | IST-REx-ID: 3854
K. Chatterjee, F. Horn, and C. Löding, “Obliging games,” presented at the CONCUR: Concurrency Theory, Paris, France, 2010, vol. 6269, pp. 284–296.
View | DOI
 

2010 | Conference Paper | IST-REx-ID: 3855 | OA
K. Chatterjee, L. Doyen, and T. A. Henzinger, “Qualitative analysis of partially-observable Markov Decision Processes,” presented at the MFCS: Mathematical Foundations of Computer Science, Brno, Czech Republic, 2010, vol. 6281, pp. 258–269.
View | Files available | DOI
 

Filters and Search Terms

department=KrCh

Search

Filter Publications