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 | OA
Chatterjee, K., Henzinger, T. A., Jobstmann, B., & Singh, R. (2011). QUASY: quantitative synthesis tool (Vol. 6605, pp. 267–271). Presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Saarbrucken, Germany: Springer. https://doi.org/10.1007/978-3-642-19835-9_24
[Submitted Version] View | Files available | DOI
 
2011 | Published | Conference Paper | IST-REx-ID: 3366 | OA
Cerny, P., Chatterjee, K., Henzinger, T. A., Radhakrishna, A., & Singh, R. (2011). Quantitative synthesis for concurrent programs. In G. Gopalakrishnan & S. Qadeer (Eds.) (Vol. 6806, pp. 243–259). Presented at the CAV: Computer Aided Verification, Snowbird, USA: Springer. https://doi.org/10.1007/978-3-642-22110-1_20
[Submitted Version] View | Files available | DOI
 
2011 | Published | Technical Report | IST-REx-ID: 5379 | OA
Chatterjee, K., & Henzinger, M. (2011). An O(n2) time algorithm for alternating Büchi games. IST Austria. https://doi.org/10.15479/AT:IST-2011-0009
[Published Version] View | Files available | DOI
 
2011 | Published | Technical Report | IST-REx-ID: 5380 | OA
Chatterjee, K. (2011). Bounded rationality in concurrent parity games. IST Austria. https://doi.org/10.15479/AT:IST-2011-0008
[Published Version] View | Files available | DOI
 
2011 | Published | Technical Report | IST-REx-ID: 5381 | OA
Chatterjee, K., & Doyen, L. (2011). Partial-observation stochastic games: How to win when belief fails. IST Austria. https://doi.org/10.15479/AT:IST-2011-0007
[Published Version] View | Files available | DOI
 
2011 | Published | Technical Report | IST-REx-ID: 5382 | OA
Chatterjee, K. (2011). Robustness of structurally equivalent concurrent parity games. IST Austria. https://doi.org/10.15479/AT:IST-2011-0006
[Published Version] View | Files available | DOI
 
2011 | Published | Technical Report | IST-REx-ID: 5384 | OA
Chatterjee, K., & Tracol, M. (2011). Decidable problems for probabilistic automata on infinite words. IST Austria. https://doi.org/10.15479/AT:IST-2011-0004
[Published Version] View | Files available | DOI
 
2011 | Published | Technical Report | IST-REx-ID: 5385 | OA
Boker, U., Chatterjee, K., Henzinger, T. A., & Kupferman, O. (2011). Temporal specifications with accumulative values. IST Austria. https://doi.org/10.15479/AT:IST-2011-0003
[Published Version] View | Files available | DOI
 
2011 | Published | Technical Report | IST-REx-ID: 5387 | OA
Chatterjee, K., & Doyen, L. (2011). Energy and mean-payoff parity Markov decision processes. IST Austria. https://doi.org/10.15479/AT:IST-2011-0001
[Published Version] View | Files available | DOI
 
2010 | Published | Conference Paper | IST-REx-ID: 489 | OA
Cristau, J., David, C., & Horn, F. (2010). How do we remember the past in randomised strategies? In Proceedings of GandALF 2010 (Vol. 25, pp. 30–39). Minori, Amalfi Coast, Italy: Open Publishing Association. https://doi.org/10.4204/EPTCS.25.7
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 
2010 | Published | Technical Report | IST-REx-ID: 5388 | OA
Chatterjee, K., Cerny, P., Henzinger, T. A., Radhakrishna, A., & Singh, R. (2010). Quantitative synthesis for concurrent programs. IST Austria. https://doi.org/10.15479/AT:IST-2010-0004
[Published Version] View | Files available | DOI
 
2010 | Published | Technical Report | IST-REx-ID: 5390 | OA
Chatterjee, K., & Fijalkow, N. (2010). Topological, automata-theoretic and logical characterization of finitary languages. IST Austria. https://doi.org/10.15479/AT:IST-2010-0002
[Published Version] View | Files available | DOI
 
2010 | Published | Conference Paper | IST-REx-ID: 3851 | OA
Chatterjee, K., & Doyen, L. (2010). Energy parity games (Vol. 6199, pp. 599–610). Presented at the ICALP: Automata, Languages and Programming, Bordeaux, France: Springer. https://doi.org/10.1007/978-3-642-14162-1_50
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
2010 | Published | Conference Paper | IST-REx-ID: 3852 | OA
Chatterjee, K., & Majumdar, R. (2010). Discounting in games across time scales (Vol. 25, pp. 22–29). Presented at the GandALF: Games, Automata, Logic, and Formal Verification, Minori, Italy: EPTCS. https://doi.org/10.4204/EPTCS.25.6
[Published Version] View | Files available | DOI | arXiv
 
2010 | Published | Conference Paper | IST-REx-ID: 3853 | OA
Chatterjee, K., Doyen, L., Edelsbrunner, H., Henzinger, T. A., & Rannou, P. (2010). Mean-payoff automaton expressions (Vol. 6269, pp. 269–283). Presented at the CONCUR: Concurrency Theory, Paris, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/978-3-642-15375-4_19
[Submitted Version] View | Files available | DOI
 
2010 | Published | Conference Paper | IST-REx-ID: 3854
Chatterjee, K., Horn, F., & Löding, C. (2010). Obliging games (Vol. 6269, pp. 284–296). Presented at the CONCUR: Concurrency Theory, Paris, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/978-3-642-15375-4_20
View | DOI
 
2010 | Published | Conference Paper | IST-REx-ID: 3855 | OA
Chatterjee, K., Doyen, L., & Henzinger, T. A. (2010). Qualitative analysis of partially-observable Markov Decision Processes (Vol. 6281, pp. 258–269). Presented at the MFCS: Mathematical Foundations of Computer Science, Brno, Czech Republic: Springer. https://doi.org/10.1007/978-3-642-15155-2_24
[Submitted Version] View | Files available | DOI
 
2010 | Published | Conference Paper | IST-REx-ID: 3856 | OA
Chatterjee, K., Doyen, L., Gimbert, H., & Henzinger, T. A. (2010). Randomness for free (Vol. 6281, pp. 246–257). Presented at the MFCS: Mathematical Foundations of Computer Science, Brno, Czech Republic: Springer. https://doi.org/10.1007/978-3-642-15155-2_23
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
2010 | Published | Conference Paper | IST-REx-ID: 3857
Chatterjee, K., & Henzinger, T. A. (2010). Probabilistic Automata on infinite words: decidability and undecidability results (Vol. 6252, pp. 1–16). Presented at the ATVA: Automated Technology for Verification and Analysis, Singapore, Singapore: Springer. https://doi.org/10.1007/978-3-642-15643-4_1
View | Files available | DOI
 
2010 | Published | Conference Paper | IST-REx-ID: 3858 | OA
Chatterjee, K., & Doyen, L. (2010). The complexity of partial-observation parity games (Vol. 6397, pp. 1–14). Presented at the LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, Yogyakarta, Indonesia: Springer. https://doi.org/10.1007/978-3-642-16242-8_1
[Submitted Version] View | Files available | DOI | WoS
 

Search

Filter Publications

Display / Sort

Citation Style: APA

Export / Embed