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.
520 Publications
2011 |
Published |
Conference Paper |
IST-REx-ID: 3365 |
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 |
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: 5379 |
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 |
Technical Report |
IST-REx-ID: 5380 |
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 |
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 |
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 |
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 |
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 |
K. Chatterjee and L. Doyen, Energy and mean-payoff parity Markov decision processes. IST Austria, 2011.
[Published Version]
View
| Files available
| DOI
2010 |
Published |
Conference Paper |
IST-REx-ID: 489 |
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.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2010 |
Published |
Technical Report |
IST-REx-ID: 5388 |
K. Chatterjee, P. Cerny, T. A. Henzinger, A. Radhakrishna, and R. Singh, Quantitative synthesis for concurrent programs. IST Austria, 2010.
[Published Version]
View
| Files available
| DOI
2010 |
Published |
Technical Report |
IST-REx-ID: 5390 |
K. Chatterjee and N. Fijalkow, Topological, automata-theoretic and logical characterization of finitary languages. IST Austria, 2010.
[Published Version]
View
| Files available
| DOI
2010 |
Published |
Conference Paper |
IST-REx-ID: 3851 |
K. Chatterjee and L. Doyen, “Energy parity games,” presented at the ICALP: Automata, Languages and Programming, Bordeaux, France, 2010, vol. 6199, pp. 599–610.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2010 |
Published |
Conference Paper |
IST-REx-ID: 3852 |
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 |
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: 3855 |
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 |
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.)
| arXiv
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
2010 |
Published |
Conference Paper |
IST-REx-ID: 3858 |
K. Chatterjee and L. Doyen, “The complexity of partial-observation parity games,” presented at the LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, Yogyakarta, Indonesia, 2010, vol. 6397, pp. 1–14.
[Submitted Version]
View
| Files available
| DOI
| WoS