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.
465 Publications
2014 |Published| Conference Paper | IST-REx-ID: 2027 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Brázdil T, Chatterjee K, Chmelik M, Forejt V, Kretinsky J, Kwiatkowska M, Parker D, Ujma M. 2014. Verification of markov decision processes using learning algorithms. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). ALENEX: Algorithm Engineering and Experiments, LNCS, vol. 8837, 98–114.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2014 |Published| Conference Paper | IST-REx-ID: 2053 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Hermanns H, Krčál J, Kretinsky J. 2014. Probabilistic bisimulation: Naturally on distributions. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). CONCUR: Concurrency Theory, LNCS, vol. 8704, 249–265.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2014 |Published| Conference Paper | IST-REx-ID: 2052
Aminof B, Kotek T, Rubin S, Spegni F, Veith H. 2014. Parameterized model checking of rendezvous systems. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). CONCUR: Concurrency Theory, LNCS, vol. 8704, 109–124.
View
| DOI
2014 |Published| Journal Article | IST-REx-ID: 2187 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Bloem R, Chatterjee K, Greimel K, Henzinger TA, Hofferek G, Jobstmann B, Könighofer B, Könighofer R. 2014. Synthesizing robust systems. Acta Informatica. 51(3–4), 193–220.
[Submitted Version]
View
| Files available
| DOI
2014 |Published| Conference Paper | IST-REx-ID: 2190 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Esparza J, Kretinsky J. 2014. From LTL to deterministic automata: A safraless compositional approach. CAV: Computer Aided Verification, LNCS, vol. 8559, 192–208.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2014 |Published| Journal Article | IST-REx-ID: 2234 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Brázdil T, Brožek V, Chatterjee K, Forejt V, Kučera A. 2014. Markov decision processes with multiple long-run average objectives. Logical Methods in Computer Science. 10(1).
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
2014 |Published| Journal Article | IST-REx-ID: 2246 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Grinshpun A, Phalitnonkiat P, Rubin S, Tarfulea A. 2014. Alternating traps in Muller and parity games. Theoretical Computer Science. 521, 73–91.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2014 |Published| Journal Article | IST-REx-ID: 2716 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Chatterjee K, Randour M, Raskin J. 2014. Strategy synthesis for multi-dimensional quantitative objectives. Acta Informatica. 51(3–4), 129–163.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2014 |Published| Journal Article | IST-REx-ID: 1733 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Cerny P, Chmelik M, Henzinger TA, Radhakrishna A. 2014. Interface simulation distances. Theoretical Computer Science. 560(3), 348–363.
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
2014 |Published| Journal Article | IST-REx-ID: 2141 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Chatterjee K, Henzinger MH. 2014. Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition. Journal of the ACM. 61(3), a15.
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
2014 |Published| Conference Paper | IST-REx-ID: 2054
Chatterjee K. 2014. Qualitative concurrent parity games: Bounded rationality. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). CONCUR: Concurrency Theory, LNCS, vol. 8704, 544–559.
View
| Files available
| DOI
2014 |Published| Conference Paper | IST-REx-ID: 475 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Aminof B, Rubin S. 2014. First cycle games. Electronic Proceedings in Theoretical Computer Science, EPTCS. SR: Strategic Reasoning, EPTCS, vol. 146, 83–90.
[Published Version]
View
| Files available
| DOI
2014 |Published| Conference Paper | IST-REx-ID: 1903
Chatterjee K. 2014. Partial-observation stochastic reachability and parity games. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 8634, 1–4.
View
| Files available
| DOI
2014 |Published| Journal Article | IST-REx-ID: 2211 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Chatterjee K, Doyen L. 2014. Partial-observation stochastic games: How to win when belief fails. ACM Transactions on Computational Logic (TOCL). 15(2), 16.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2014 |Published| Journal Article | IST-REx-ID: 2038 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Boker U, Chatterjee K, Henzinger TA, Kupferman O. 2014. Temporal specifications with accumulative values. ACM Transactions on Computational Logic (TOCL). 15(4), 27.
[Submitted Version]
View
| Files available
| DOI
2014 |Published| Conference Paper | IST-REx-ID: 2162 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Chatterjee K, Ibsen-Jensen R. 2014. The complexity of ergodic mean payoff games. ICST: International Conference on Software Testing, Verification and Validation, LNCS, vol. 8573, 122–133.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2014 |Published| Conference Paper | IST-REx-ID: 2213 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Chatterjee K, Doyen L, Nain S, Vardi M. 2014. The complexity of partial-observation stochastic parity games with finite-memory strategies. FoSSaCS: Foundations of Software Science and Computation Structures, LNCS, vol. 8412, 242–257.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2014 |Published| Conference Paper | IST-REx-ID: 2212
Chatterjee K, Doyen L, Gimbert H, Oualhadj Y. 2014. Perfect-information stochastic mean-payoff parity games. FoSSaCS: Foundations of Software Science and Computation Structures, LNCS, vol. 8412, 210–225.
View
| Files available
| DOI
2014 |Published| Conference Paper | IST-REx-ID: 2216 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Chatterjee K, Ibsen-Jensen R, Majumdar R. 2014. Edit distance for timed automata. HSCC: Hybrid Systems - Computation and Control, 303–312.
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
2014 |Published| Technical Report | IST-REx-ID: 5413 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Chatterjee K, Daca P, Chmelik M. 2014. CEGAR for qualitative analysis of probabilistic systems, IST Austria, 33p.
[Published Version]
View
| Files available
| DOI