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

2011 | Published | Conference Paper | IST-REx-ID: 3351 | OA
Chatterjee K, Doyen L, Singh R. 2011. On memoryless quantitative objectives. FCT: Fundamentals of Computation Theory, LNCS, vol. 6914, 148–159.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | arXiv
 
2011 | Published | Conference Paper | IST-REx-ID: 3348 | OA
Chatterjee K, Prabhu V. 2011. Synthesis of memory efficient real time controllers for safety objectives. HSCC: Hybrid Systems - Computation and Control, 221–230.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | arXiv
 
2011 | Published | Conference Paper | IST-REx-ID: 3349 | OA
Chatterjee K, Fijalkow N. 2011. A reduction from parity games to simple stochastic games. GandALF: Games, Automata, Logic, and Formal Verification, EPTCS, vol. 54, 74–86.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | arXiv
 
2011 | Submitted | Preprint | IST-REx-ID: 3339 | OA
Chatterjee K, De Alfaro L, Pritam R. Magnifying lens abstraction for stochastic games with discounted and long-run average objectives. arXiv, 1107.2132.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
2011 | Submitted | Preprint | IST-REx-ID: 3363 | OA
Chatterjee K, Henzinger TA, Tracol M. The decidability frontier for probabilistic automata on infinite words. 1104.0127.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
2011 | Published | Technical Report | IST-REx-ID: 5380 | OA
Chatterjee K. 2011. Bounded rationality in concurrent parity games, IST Austria, 53p.
[Published Version] View | Files available | DOI
 
2011 | Submitted | Preprint | IST-REx-ID: 3338 | OA
Chatterjee K. Bounded rationality in concurrent parity games. arXiv, 1–51, 1107.2146.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
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, 20p.
[Published Version] View | Files available | DOI
 
2011 | Published | Conference Paper | IST-REx-ID: 3316 | OA
Bloem R, Chatterjee K, Greimel K, Henzinger TA, Jobstmann B. 2011. Specification-centered robustness. 6th IEEE International Symposium on Industrial and Embedded Systems. SIES: International Symposium on Industrial Embedded Systems, 176–185.
[Published Version] View | DOI | Download Published Version (ext.)
 
2011 | Published | Conference Paper | IST-REx-ID: 3342 | OA
Chatterjee K, Henzinger M, Joglekar M, Nisarg S. 2011. Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives. CAV: Computer Aided Verification, LNCS, vol. 6806, 260–276.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
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, 43p.
[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, 30p.
[Published Version] View | Files available | DOI
 
2011 | Published | Conference Paper | IST-REx-ID: 3361 | OA
Cerny P, Chatterjee K, Henzinger TA. 2011. The complexity of quantitative information flow problems. CSF: Computer Security Foundations, 205–217.
[Submitted Version] View | Files available | DOI | WoS
 
2011 | Published | Conference Paper | IST-REx-ID: 3346 | OA
Brázdil T, Brožek V, Chatterjee K, Forejt V, Kučera A. 2011. Two views on multiple mean payoff objectives in Markov Decision Processes. LICS: Logic in Computer Science, 5970225.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS | arXiv
 
2011 | Published | Journal Article | IST-REx-ID: 3354
Chatterjee K, De Alfaro L, Henzinger TA. 2011. Qualitative concurrent parity games. ACM Transactions on Computational Logic (TOCL). 12(4), 28.
View | Files available | DOI | WoS
 
2011 | Published | Conference Paper | IST-REx-ID: 3356 | OA
Boker U, Chatterjee K, Henzinger TA, Kupferman O. 2011. Temporal specifications with accumulative values. LICS: Logic in Computer Science, 5970226.
[Submitted Version] View | Files available | DOI | WoS
 
2011 | Published | Technical Report | IST-REx-ID: 5385 | OA
Boker U, Chatterjee K, Henzinger TA, Kupferman O. 2011. Temporal specifications with accumulative values, IST Austria, 14p.
[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, 21p.
[Published Version] View | Files available | DOI
 
2010 | Published | Conference Paper | IST-REx-ID: 3852 | OA
Chatterjee K, Majumdar R. 2010. Discounting in games across time scales. GandALF: Games, Automata, Logic, and Formal Verification, EPTCS, vol. 25, 22–29.
[Published Version] View | Files available | DOI | arXiv
 
2010 | Published | Conference Paper | IST-REx-ID: 3854
Chatterjee K, Horn F, Löding C. 2010. Obliging games. CONCUR: Concurrency Theory, LNCS, vol. 6269, 284–296.
View | DOI
 

Search

Filter Publications

Display / Sort

Citation Style: ISTA Annual Report

Export / Embed