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.




485 Publications

2011 | Published | 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.
[Submitted Version] View | Files available | DOI
 
2011 | Published | 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 | Published | 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.
[Submitted Version] View | Files available | DOI
 
2011 | Submitted | Preprint | IST-REx-ID: 3363 | OA
K. Chatterjee, T. A. Henzinger, and M. Tracol, “The decidability frontier for probabilistic automata on infinite words.” ArXiv.
[Preprint] View | Download Preprint (ext.) | arXiv
 
2011 | Published | 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.
[Submitted Version] View | Files available | DOI
 
2011 | Published | 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.
[Submitted Version] View | Files available | DOI
 
2011 | Published | Technical Report | IST-REx-ID: 5380 | OA
K. Chatterjee, Bounded rationality in concurrent parity games. IST Austria, 2011.
[Published Version] View | Files available | DOI
 
2011 | Published | Technical Report | IST-REx-ID: 5381 | OA
K. Chatterjee and L. Doyen, Partial-observation stochastic games: How to win when belief fails. IST Austria, 2011.
[Published Version] View | Files available | DOI
 
2011 | Published | Technical Report | IST-REx-ID: 5382 | OA
K. Chatterjee, Robustness of structurally equivalent concurrent parity games. IST Austria, 2011.
[Published Version] View | Files available | DOI
 
2011 | Published | Technical Report | IST-REx-ID: 5384 | OA
K. Chatterjee and M. Tracol, Decidable problems for probabilistic automata on infinite words. IST Austria, 2011.
[Published Version] View | Files available | DOI
 
2011 | Published | Technical Report | IST-REx-ID: 5385 | OA
U. Boker, K. Chatterjee, T. A. Henzinger, and O. Kupferman, Temporal specifications with accumulative values. IST Austria, 2011.
[Published Version] View | Files available | DOI
 
2011 | Published | Technical Report | IST-REx-ID: 5387 | OA
K. Chatterjee and L. Doyen, Energy and mean-payoff parity Markov decision processes. IST Austria, 2011.
[Published Version] View | Files available | DOI
 
2011 | Published | Technical Report | IST-REx-ID: 5379 | OA
K. Chatterjee and M. Henzinger, An O(n2) time algorithm for alternating Büchi games. IST Austria, 2011.
[Published Version] View | Files available | DOI
 
2011 | Published | Conference Paper | IST-REx-ID: 3316 | OA
Bloem, Roderick, Specification-centered robustness. 6th IEEE International Symposium on Industrial and Embedded Systems. 2011
[Published Version] View | DOI | Download Published Version (ext.)
 
2010 | Published | 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.
[Published Version] View | Files available | DOI | arXiv
 
2010 | Published | 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.
[Submitted Version] View | Files available | DOI
 
2010 | Published | 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 | Published | 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.
[Submitted Version] View | Files available | DOI
 
2010 | Published | Conference Paper | IST-REx-ID: 3856 | OA
K. Chatterjee, L. Doyen, H. Gimbert, and T. A. Henzinger, “Randomness for free,” presented at the MFCS: Mathematical Foundations of Computer Science, Brno, Czech Republic, 2010, vol. 6281, pp. 246–257.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
2010 | Published | Conference Paper | IST-REx-ID: 3857
K. Chatterjee and T. A. Henzinger, “Probabilistic Automata on infinite words: decidability and undecidability results,” presented at the ATVA: Automated Technology for Verification and Analysis, Singapore, Singapore, 2010, vol. 6252, pp. 1–16.
View | Files available | DOI
 

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed