Please note that ISTA Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.

10590 Publications


2013 | Published | Journal Article | IST-REx-ID: 2854 | OA
K. Chatterjee, L. De Alfaro, and T. A. Henzinger, “Strategy improvement for concurrent reachability and turn based stochastic safety games,” Journal of Computer and System Sciences, vol. 79, no. 5. Elsevier, pp. 640–657, 2013.
[Published Version] View | Files available | DOI
 

2013 | Published | Journal Article | IST-REx-ID: 2814 | OA
K. Chatterjee, L. Alfaro, and R. Majumdar, “The complexity of coverage,” International Journal of Foundations of Computer Science, vol. 24, no. 2. World Scientific Publishing, pp. 165–185, 2013.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2013 | Published | Conference Paper | IST-REx-ID: 1374 | OA
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: 2446 | OA
K. Chatterjee, A. Gaiser, and J. Kretinsky, “Automata with generalized Rabin pairs for probabilistic model checking and LTL synthesis,” vol. 8044. Springer, pp. 559–575, 2013.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2013 | Published | Conference Paper | IST-REx-ID: 2444 | OA
K. Chatterjee and J. Ła̧Cki, “Faster algorithms for Markov decision processes with low treewidth,” vol. 8044. Springer, pp. 543–558, 2013.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2013 | Published | Conference Paper | IST-REx-ID: 2886 | OA
M. Chmelik and V. Řehák, “Controllable-choice message sequence graphs,” vol. 7721. Springer, pp. 118–130, 2013.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 

2013 | Published | Journal Article | IST-REx-ID: 2836 | OA
K. Chatterjee and V. Raman, “Assume-guarantee synthesis for digital contract signing,” Formal Aspects of Computing, vol. 26, no. 4. Springer, pp. 825–859, 2013.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2013 | Published | Journal Article | IST-REx-ID: 2824
K. Chatterjee and V. Prabhu, “Synthesis of memory-efficient, clock-memory free, and non-Zeno safety controllers for timed systems,” Information and Computation, vol. 228–229. Elsevier, pp. 83–119, 2013.
View | DOI
 

2013 | Published | Conference Paper | IST-REx-ID: 2305 | OA
T. Brázdil, K. Chatterjee, V. Forejt, and A. Kučera, “Trading performance for stability in Markov decision processes,” in 28th Annual ACM/IEEE Symposium, New Orleans, LA, United States, 2013, pp. 331–340.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2013 | Published | Conference Paper | IST-REx-ID: 2279 | OA
K. Chatterjee, L. Doyen, M. Randour, and J. Raskin, “Looking at mean-payoff and total-payoff through windows,” vol. 8172. Springer, pp. 118–132, 2013.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 

2013 | Published | Conference Paper | IST-REx-ID: 2295 | OA
K. Chatterjee, M. Chmelik, and M. Tracol, “What is decidable about partially observable Markov decision processes with omega-regular objectives,” vol. 23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp. 165–180, 2013.
[Published Version] View | Files available | DOI
 

2013 | Published | Technical Report | IST-REx-ID: 5400 | OA
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: 5404 | OA
K. Chatterjee and R. Ibsen-Jensen, The complexity of ergodic games. IST Austria, 2013.
[Published Version] View | Files available | DOI
 

2013 | Published | Conference Paper | IST-REx-ID: 2329 | OA
K. Chatterjee and Y. Velner, “Hyperplane separation technique for multidimensional mean-payoff games,” vol. 8052. Springer, pp. 500–515, 2013.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2013 | Published | Conference Paper | IST-REx-ID: 10902
Chatterjee, Krishnendu, How to travel between languages. 7th International Conference on Language and Automata Theory and Applications 7810. 2013
View | DOI
 

2013 | Published | Technical Report | IST-REx-ID: 5405 | OA
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
 

2013 | Published | Technical Report | IST-REx-ID: 5408 | OA
K. Chatterjee, L. Doyen, S. Nain, and M. Vardi, The complexity of partial-observation stochastic parity games with finite-memory strategies. IST Austria, 2013.
[Published Version] View | Files available | DOI
 

2013 | Published | Journal Article | IST-REx-ID: 2817 | OA
S. Novak, K. Chatterjee, and M. Nowak, “Density games,” Journal of Theoretical Biology, vol. 334. Elsevier, pp. 26–34, 2013.
[Published Version] View | Files available | DOI
 

2013 | Published | Journal Article | IST-REx-ID: 2289 | OA
T. A. Henzinger, “Quantitative reactive modeling and verification,” Computer Science Research and Development, vol. 28, no. 4. Springer, pp. 331–344, 2013.
[Published Version] View | Files available | DOI
 

2013 | Published | Conference Paper | IST-REx-ID: 2181 | OA
T. A. Henzinger, C. Kirsch, H. Payer, A. Sezgin, and A. Sokolova, “Quantitative relaxation of concurrent data structures,” in Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language, Rome, Italy, 2013, pp. 317–328.
[Submitted Version] View | Files available | DOI
 

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed