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.
470 Publications
2011 |Published| Conference Paper | IST-REx-ID: 3342 |
K. Chatterjee, M. H. Henzinger, M. Joglekar, and S. Nisarg, “Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives,” presented at the CAV: Computer Aided Verification, Snowbird, USA, 2011, vol. 6806, pp. 260–276.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2011 |Published| Conference Paper | IST-REx-ID: 3347 |
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.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2011 |Published| Conference Paper | IST-REx-ID: 3346 |
T. Brázdil, V. Brožek, K. Chatterjee, V. Forejt, and A. Kučera, “Two views on multiple mean payoff objectives in Markov Decision Processes,” presented at the LICS: Logic in Computer Science, Toronto, Canada, 2011.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2011 |Published| Conference Paper | IST-REx-ID: 3348 |
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.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2011 |Published| Conference Paper | IST-REx-ID: 3343 |
K. Chatterjee and M. H. Henzinger, “Faster and dynamic algorithms for maximal end-component decomposition and related graph problems in probabilistic verification,” presented at the SODA: Symposium on Discrete Algorithms, San Francisco, SA, United States, 2011, pp. 1318–1336.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2011 |Published| Conference Paper | IST-REx-ID: 3361 |
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 |Published| Technical Report | IST-REx-ID: 5379 |
K. Chatterjee and M. H. 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: 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: 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: 5382 |
K. Chatterjee, Robustness of structurally equivalent concurrent parity games. IST Austria, 2011.
[Published Version]
View
| Files available
| DOI
2011 |Published| Preprint | IST-REx-ID: 3338 |
K. Chatterjee, “Bounded rationality in concurrent parity games,” arXiv. ArXiv, pp. 1–51, 2011.
[Preprint]
View
| Files available
| Download Preprint (ext.)
| arXiv
2011 |Published| Conference Paper | IST-REx-ID: 3356 |
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| 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: 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| 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| Conference Paper | IST-REx-ID: 3345 |
K. Chatterjee and L. Doyen, “Energy and mean-payoff parity Markov Decision Processes,” presented at the MFCS: Mathematical Foundations of Computer Science, Warsaw, Poland, 2011, vol. 6907, pp. 206–218.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
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: 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