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.
508 Publications
2014 | Published | Technical Report | IST-REx-ID: 5412 |
K. Chatterjee, P. Daca, and M. Chmelik, CEGAR for qualitative analysis of probabilistic systems. IST Austria, 2014.
[Published Version]
View
| Files available
| DOI
2014 | Published | Technical Report | IST-REx-ID: 5414 |
K. Chatterjee, P. Daca, and M. Chmelik, CEGAR for qualitative analysis of probabilistic systems. IST Austria, 2014.
[Published Version]
View
| Files available
| DOI
2014 | Published | Technical Report | IST-REx-ID: 5413 |
K. Chatterjee, P. Daca, and M. Chmelik, CEGAR for qualitative analysis of probabilistic systems. IST Austria, 2014.
[Published Version]
View
| Files available
| DOI
2014 | Published | Conference Paper | IST-REx-ID: 2063
K. Chatterjee, M. Chmelik, and P. Daca, “CEGAR for qualitative analysis of probabilistic systems,” presented at the CAV: Computer Aided Verification, Vienna, Austria, 2014, vol. 8559, pp. 473–490.
View
| Files available
| DOI
2014 | Published | Conference Paper | IST-REx-ID: 2053 |
H. Hermanns, J. Krčál, and J. Kretinsky, “Probabilistic bisimulation: Naturally on distributions,” in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Rome, Italy, 2014, vol. 8704, pp. 249–265.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| arXiv
2014 | Published | Conference Paper | IST-REx-ID: 2027 |
T. Brázdil et al., “Verification of markov decision processes using learning algorithms,” in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Sydney, Australia, 2014, vol. 8837, pp. 98–114.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| arXiv
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.)
| arXiv
2014 | Published | Technical Report | IST-REx-ID: 5428 |
K. Chatterjee, T. A. Henzinger, J. Otop, and Y. Velner, Quantitative fair simulation games. IST Austria, 2014.
[Published Version]
View
| Files available
| DOI
2014 | Published | Conference Paper | IST-REx-ID: 10885 |
K. Chatterjee, L. Doyen, E. Filiot, and J.-F. Raskin, “Doomsday equilibria for omega-regular games,” in VMCAI 2014: Verification, Model Checking, and Abstract Interpretation, San Diego, CA, United States, 2014, vol. 8318, pp. 78–97.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2014 | Published | Technical Report | IST-REx-ID: 5415 |
K. Chatterjee, T. A. Henzinger, and J. Otop, Nested weighted automata. IST Austria, 2014.
[Published Version]
View
| Files available
| DOI
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.)
| WoS
| arXiv
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
| WoS
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.)
| WoS
| 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
| WoS
2014 | Published | Conference Paper | IST-REx-ID: 1903 |
K. Chatterjee, “Partial-observation stochastic reachability and parity games,” presented at the MFCS: Mathematical Foundations of Computer Science, Budapest, Hungary, 2014, vol. 8634, no. PART 1, pp. 1–4.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
2014 | Published | Journal Article | IST-REx-ID: 2141 |
K. Chatterjee and M. Henzinger, “Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition,” Journal of the ACM, vol. 61, no. 3. ACM, 2014.
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
| WoS
2014 | Published | Journal Article | IST-REx-ID: 2039 |
K. Chatterjee, A. Pavlogiannis, B. Adlam, and M. Nowak, “The time scale of evolutionary innovation,” PLoS Computational Biology, vol. 10, no. 9. Public Library of Science, 2014.
[Published Version]
View
| Files available
| DOI
| WoS
2014 | Research Data Reference | IST-REx-ID: 9739
K. Chatterjee, A. Pavlogiannis, B. Adlam, and M. Novak, “Detailed proofs for ‘The time scale of evolutionary innovation.’” Public Library of Science, 2014.
[Published Version]
View
| Files available
| DOI
2014 | Published | Journal Article | IST-REx-ID: 1733 |
P. Cerny, M. Chmelik, T. A. Henzinger, and A. Radhakrishna, “Interface simulation distances,” Theoretical Computer Science, vol. 560, no. 3. Elsevier, pp. 348–363, 2014.
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
| WoS
| arXiv
2014 | Published | Journal Article | IST-REx-ID: 535 |
K. Chatterjee, M. 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.)
| WoS
| arXiv