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.
454 Publications
2014 |
Published |
Conference Paper |
IST-REx-ID: 2163 |
K. Chatterjee and L. Doyen, “Games with a weak adversary,” in Lecture Notes in Computer Science, Copenhagen, Denmark, 2014, vol. 8573, no. Part 2, pp. 110–121.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2014 |
Published |
Journal Article |
IST-REx-ID: 2187 |
R. Bloem et al., “Synthesizing robust systems,” Acta Informatica, vol. 51, no. 3–4. Springer, pp. 193–220, 2014.
[Submitted Version]
View
| Files available
| DOI
2014 |
Published |
Conference Paper |
IST-REx-ID: 2190 |
J. Esparza and J. Kretinsky, “From LTL to deterministic automata: A safraless compositional approach,” presented at the CAV: Computer Aided Verification, 2014, vol. 8559, pp. 192–208.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2014 |
Published |
Journal Article |
IST-REx-ID: 2211 |
K. Chatterjee and L. Doyen, “Partial-observation stochastic games: How to win when belief fails,” ACM Transactions on Computational Logic (TOCL), vol. 15, no. 2. ACM, 2014.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2014 |
Published |
Conference Paper |
IST-REx-ID: 2212
K. Chatterjee, L. Doyen, H. Gimbert, and Y. Oualhadj, “Perfect-information stochastic mean-payoff parity games,” presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Grenoble, France, 2014, vol. 8412, pp. 210–225.
View
| Files available
| DOI
2014 |
Published |
Conference Paper |
IST-REx-ID: 2213 |
K. Chatterjee, L. Doyen, S. Nain, and M. Vardi, “The complexity of partial-observation stochastic parity games with finite-memory strategies,” presented at the FoSSaCS: Foundations of Software Science and Computation Structures, Grenoble, France, 2014, vol. 8412, pp. 242–257.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2014 |
Published |
Conference Paper |
IST-REx-ID: 2216 |
K. Chatterjee, R. Ibsen-Jensen, and R. Majumdar, “Edit distance for timed automata,” presented at the HSCC: Hybrid Systems - Computation and Control, Berlin, Germany, 2014, pp. 303–312.
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
2014 |
Published |
Journal Article |
IST-REx-ID: 2234 |
T. Brázdil, V. Brožek, K. Chatterjee, V. Forejt, and A. Kučera, “Markov decision processes with multiple long-run average objectives,” Logical Methods in Computer Science, vol. 10, no. 1. International Federation of Computational Logic, 2014.
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
2014 |
Published |
Journal Article |
IST-REx-ID: 2246 |
A. Grinshpun, P. Phalitnonkiat, S. Rubin, and A. Tarfulea, “Alternating traps in Muller and parity games,” Theoretical Computer Science, vol. 521. Elsevier, pp. 73–91, 2014.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2014 |
Published |
Journal Article |
IST-REx-ID: 2716 |
K. Chatterjee, M. Randour, and J. Raskin, “Strategy synthesis for multi-dimensional quantitative objectives,” Acta Informatica, vol. 51, no. 3–4. Springer, pp. 129–163, 2014.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2014 |
Published |
Conference Paper |
IST-REx-ID: 475 |
B. Aminof and S. Rubin, “First cycle games,” in Electronic Proceedings in Theoretical Computer Science, EPTCS, Grenoble, France, 2014, vol. 146, pp. 83–90.
[Published Version]
View
| Files available
| DOI
2014 |
Published |
Journal Article |
IST-REx-ID: 535 |
K. Chatterjee, M. H. Henzinger, S. Krinninger, and D. Nanongkai, “Polynomial-time algorithms for energy games with special weight structures,” Algorithmica, vol. 70, no. 3. Springer, pp. 457–492, 2014.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2013 |
Published |
Conference Paper |
IST-REx-ID: 2000 |
J. Reiter, I. Božić, K. Chatterjee, and M. Nowak, “TTP: Tool for tumor progression,” in Proceedings of 25th Int. Conf. on Computer Aided Verification, St. Petersburg, Russia, 2013, vol. 8044, pp. 101–106.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2013 |
Published |
Conference Paper |
IST-REx-ID: 1374 |
K. Chatterjee and N. Fijalkow, “Infinite-state games with finitary conditions,” in 22nd EACSL Annual Conference on Computer Science Logic, Torino, Italy, 2013, vol. 23, pp. 181–196.
[Published Version]
View
| Files available
| DOI
2013 |
Published |
Conference Paper |
IST-REx-ID: 1376
K. Chatterjee, T. A. Henzinger, J. Otop, and A. Pavlogiannis, “Distributed synthesis for LTL fragments,” in 13th International Conference on Formal Methods in Computer-Aided Design, Portland, OR, United States, 2013, pp. 18–25.
View
| Files available
| DOI
2013 |
Published |
Technical Report |
IST-REx-ID: 5399 |
J. Reiter, I. Bozic, K. Chatterjee, and M. Nowak, TTP: Tool for Tumor Progression. IST Austria, 2013.
[Published Version]
View
| Files available
| DOI
2013 |
Published |
Technical Report |
IST-REx-ID: 5400 |
K. Chatterjee, M. Chmelik, and M. Tracol, What is decidable about partially observable Markov decision processes with ω-regular objectives. IST Austria, 2013.
[Published Version]
View
| Files available
| DOI
2013 |
Published |
Technical Report |
IST-REx-ID: 5403 |
K. Chatterjee and R. Ibsen-Jensen, Qualitative analysis of concurrent mean-payoff games. IST Austria, 2013.
[Published Version]
View
| Files available
| DOI
2013 |
Published |
Technical Report |
IST-REx-ID: 5404 |
K. Chatterjee and R. Ibsen-Jensen, The complexity of ergodic games. IST Austria, 2013.
[Published Version]
View
| Files available
| DOI
2013 |
Published |
Technical Report |
IST-REx-ID: 5405 |
K. Chatterjee, L. Doyen, H. Gimbert, and Y. Oualhadj, Perfect-information stochastic mean-payoff parity games. IST Austria, 2013.
[Published Version]
View
| Files available
| DOI