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.

527 Publications


2011 | Published | Conference Paper | IST-REx-ID: 3343 | OA
Chatterjee K, Henzinger M. 2011. Faster and dynamic algorithms for maximal end-component decomposition and related graph problems in probabilistic verification. SODA: Symposium on Discrete Algorithms, 1318–1336.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 

2011 | Published | Conference Paper | IST-REx-ID: 3344
Chatterjee K. 2011. Graph games with reachability objectives. 5th International Workshop on Reachability Problems. RP: Reachability Problems, LNCS, vol. 6945, 1–1.
View | DOI
 

2011 | Published | Conference Paper | IST-REx-ID: 3345 | OA
Chatterjee K, Doyen L. 2011. Energy and mean-payoff parity Markov Decision Processes. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 6907, 206–218.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

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 | Conference Paper | IST-REx-ID: 3347 | OA
Chatterjee K, Fijalkow N. 2011. Finitary languages. LATA: Language and Automata Theory and Applications, LNCS, vol. 6638, 216–226.
[Preprint] View | DOI | Download Preprint (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 | Published | Conference Paper | IST-REx-ID: 3350
Chatterjee K, Majumdar R. 2011. Minimum attention controller synthesis for omega regular objectives. FORMATS: Formal Modeling and Analysis of Timed Systems, LNCS, vol. 6919, 145–159.
View | DOI
 

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
 

earlier version | 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
 

earlier version | 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 | Conference Paper | IST-REx-ID: 3357
Chatterjee K, Henzinger TA, Horn F. 2011. The complexity of request-response games. LATA: Language and Automata Theory and Applications, LNCS, vol. 6638, 227–237.
View | 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 | 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 | Conference Paper | IST-REx-ID: 3365 | OA
Chatterjee K, Henzinger TA, Jobstmann B, Singh R. 2011. QUASY: quantitative synthesis tool. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 6605, 267–271.
[Submitted Version] View | Files available | DOI
 

2011 | Published | Conference Paper | IST-REx-ID: 3366 | OA
Cerny P, Chatterjee K, Henzinger TA, Radhakrishna A, Singh R. 2011. Quantitative synthesis for concurrent programs. CAV: Computer Aided Verification, LNCS, vol. 6806, 243–259.
[Submitted Version] View | Files available | DOI
 

2010 | Published | Conference Paper | IST-REx-ID: 4388 | OA
Chatterjee K, Henzinger TA, Jobstmann B, Radhakrishna A. 2010. GIST: A solver for probabilistic games. CAV: Computer Aided Verification, LNCS, vol. 6174, 665–669.
[Submitted Version] View | Files available | DOI | arXiv
 

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? Proceedings of GandALF 2010. GandALF: Games, Automata, Logic, and Formal Verification, EPTCS, vol. 25, 30–39.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 

earlier version | 2010 | Published | Technical Report | IST-REx-ID: 5388 | OA
Chatterjee K, Cerny P, Henzinger TA, Radhakrishna A, Singh R. 2010. Quantitative synthesis for concurrent programs, IST Austria, 17p.
[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
 

Filters and Search Terms

department=KrCh

Search

Filter Publications

Display / Sort

Citation Style: ISTA Annual Report

Export / Embed