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.
459 Publications
2011 | Conference Paper | IST-REx-ID: 3316 | 
Bloem R, Chatterjee K, Greimel K, Henzinger TA, Jobstmann B. Specification-centered robustness. In: 6th IEEE International Symposium on Industrial and Embedded Systems. IEEE; 2011:176-185. doi:10.1109/SIES.2011.5953660
[Published Version]
View
| DOI
| Download Published Version (ext.)
2011 | Conference Paper | IST-REx-ID: 3350
Chatterjee K, Majumdar R. Minimum attention controller synthesis for omega regular objectives. In: Fahrenberg U, Tripakis S, eds. Vol 6919. Springer; 2011:145-159. doi:10.1007/978-3-642-24310-3_11
View
| DOI
2011 | Conference Paper | IST-REx-ID: 3351 |
Chatterjee K, Doyen L, Singh R. On memoryless quantitative objectives. In: Owe O, Steffen M, Telle JA, eds. Vol 6914. Springer; 2011:148-159. doi:10.1007/978-3-642-22953-4_13
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2011 | Journal Article | IST-REx-ID: 3354
Chatterjee K, De Alfaro L, Henzinger TA. Qualitative concurrent parity games. ACM Transactions on Computational Logic (TOCL). 2011;12(4). doi:10.1145/1970398.1970404
View
| Files available
| DOI
2011 | Conference Paper | IST-REx-ID: 3349 |
Chatterjee K, Fijalkow N. A reduction from parity games to simple stochastic games. In: Vol 54. EPTCS; 2011:74-86. doi:10.4204/EPTCS.54.6
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2011 | Conference Paper | IST-REx-ID: 3365 |
Chatterjee K, Henzinger TA, Jobstmann B, Singh R. QUASY: quantitative synthesis tool. In: Vol 6605. Springer; 2011:267-271. doi:10.1007/978-3-642-19835-9_24
[Submitted Version]
View
| Files available
| DOI
2011 | Preprint | IST-REx-ID: 3363 |
Chatterjee K, Henzinger TA, Tracol M. The decidability frontier for probabilistic automata on infinite words.
[Preprint]
View
| Download Preprint (ext.)
| arXiv
2011 | Journal Article | IST-REx-ID: 3315 |
Chatterjee K, Henzinger TA, Prabhu V. Timed parity games: Complexity and robustness. Logical Methods in Computer Science. 2011;7(4). doi:10.2168/LMCS-7(4:8)2011
[Published Version]
View
| Files available
| DOI
2011 | Preprint | IST-REx-ID: 3339 |
Chatterjee K, De Alfaro L, Pritam R. Magnifying lens abstraction for stochastic games with discounted and long-run average objectives. arXiv. 2011.
[Preprint]
View
| Download Preprint (ext.)
| arXiv
2011 | Conference Paper | IST-REx-ID: 3342 |
Chatterjee K, Henzinger MH, Joglekar M, Nisarg S. Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives. In: Gopalakrishnan G, Qadeer S, eds. Vol 6806. Springer; 2011:260-276. doi:10.1007/978-3-642-22110-1_21
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2011 | Conference Paper | IST-REx-ID: 3347 |
Chatterjee K, Fijalkow N. Finitary languages. In: Vol 6638. Springer; 2011:216-226. doi:10.1007/978-3-642-21254-3_16
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2011 | Conference Paper | IST-REx-ID: 3346 |
Brázdil T, Brožek V, Chatterjee K, Forejt V, Kučera A. Two views on multiple mean payoff objectives in Markov Decision Processes. In: IEEE; 2011. doi:10.1109/LICS.2011.10
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2011 | Conference Paper | IST-REx-ID: 3348 |
Chatterjee K, Prabhu V. Synthesis of memory efficient real time controllers for safety objectives. In: Springer; 2011:221-230. doi:10.1145/1967701.1967734
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2011 | Conference Paper | IST-REx-ID: 3344
Chatterjee K. Graph games with reachability objectives. In: Delzanno G, Potapov I, eds. Vol 6945. Springer; 2011:1-1. doi:10.1007/978-3-642-24288-5_1
View
| DOI
2011 | Conference Paper | IST-REx-ID: 3343 |
Chatterjee K, Henzinger MH. Faster and dynamic algorithms for maximal end-component decomposition and related graph problems in probabilistic verification. In: SIAM; 2011:1318-1336. doi:10.1137/1.9781611973082.101
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2011 | Conference Paper | IST-REx-ID: 3361 |
Cerny P, Chatterjee K, Henzinger TA. The complexity of quantitative information flow problems. In: IEEE; 2011:205-217. doi:10.1109/CSF.2011.21
[Submitted Version]
View
| Files available
| DOI
2011 | Conference Paper | IST-REx-ID: 3357
Chatterjee K, Henzinger TA, Horn F. The complexity of request-response games. In: Dediu A-H, Inenaga S, Martín-Vide C, eds. Vol 6638. Springer; 2011:227-237. doi:10.1007/978-3-642-21254-3_17
View
| DOI
2011 | Technical Report | IST-REx-ID: 5379 |
Chatterjee K, Henzinger MH. An O(N2) Time Algorithm for Alternating Büchi Games. IST Austria; 2011. doi:10.15479/AT:IST-2011-0009
[Published Version]
View
| Files available
| DOI
2011 | Technical Report | IST-REx-ID: 5381 |
Chatterjee K, Doyen L. Partial-Observation Stochastic Games: How to Win When Belief Fails. IST Austria; 2011. doi:10.15479/AT:IST-2011-0007
[Published Version]
View
| Files available
| DOI
2011 | Technical Report | IST-REx-ID: 5380 |
Chatterjee K. Bounded Rationality in Concurrent Parity Games. IST Austria; 2011. doi:10.15479/AT:IST-2011-0008
[Published Version]
View
| Files available
| DOI