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


2014 | Conference Paper | IST-REx-ID: 2053 | OA
Probabilistic bisimulation: Naturally on distributions
H. Hermanns, J. Krčál, J. Kretinsky, in:, P. Baldan, D. Gorla (Eds.), Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014, pp. 249–265.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 

2014 | Conference Paper | IST-REx-ID: 2052
Parameterized model checking of rendezvous systems
B. Aminof, T. Kotek, S. Rubin, F. Spegni, H. Veith, in:, P. Baldan, D. Gorla (Eds.), Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014, pp. 109–124.
View | DOI
 

2014 | Journal Article | IST-REx-ID: 2187 | OA
Synthesizing robust systems
R. Bloem, K. Chatterjee, K. Greimel, T.A. Henzinger, G. Hofferek, B. Jobstmann, B. Könighofer, R. Könighofer, Acta Informatica 51 (2014) 193–220.
[Submitted Version] View | Files available | DOI
 

2014 | Conference Paper | IST-REx-ID: 2190 | OA
From LTL to deterministic automata: A safraless compositional approach
J. Esparza, J. Kretinsky, in:, Springer, 2014, pp. 192–208.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 

2014 | Journal Article | IST-REx-ID: 2234 | OA
Markov decision processes with multiple long-run average objectives
T. Brázdil, V. Brožek, K. Chatterjee, V. Forejt, A. Kučera, Logical Methods in Computer Science 10 (2014).
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 

2014 | Journal Article | IST-REx-ID: 2246 | OA
Alternating traps in Muller and parity games
A. Grinshpun, P. Phalitnonkiat, S. Rubin, A. Tarfulea, Theoretical Computer Science 521 (2014) 73–91.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 

2014 | Journal Article | IST-REx-ID: 2716 | OA
Strategy synthesis for multi-dimensional quantitative objectives
K. Chatterjee, M. Randour, J. Raskin, Acta Informatica 51 (2014) 129–163.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2014 | Journal Article | IST-REx-ID: 1733 | OA
Interface simulation distances
P. Cerny, M. Chmelik, T.A. Henzinger, A. Radhakrishna, Theoretical Computer Science 560 (2014) 348–363.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.)
 

2014 | Journal Article | IST-REx-ID: 2141 | OA
Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition
K. Chatterjee, M.H. Henzinger, Journal of the ACM 61 (2014).
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.)
 

2014 | Conference Paper | IST-REx-ID: 2054
Qualitative concurrent parity games: Bounded rationality
K. Chatterjee, in:, P. Baldan, D. Gorla (Eds.), Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014, pp. 544–559.
View | Files available | DOI
 

2014 | Conference Paper | IST-REx-ID: 475 | OA
First cycle games
B. Aminof, S. Rubin, in:, Electronic Proceedings in Theoretical Computer Science, EPTCS, Open Publishing Association, 2014, pp. 83–90.
[Published Version] View | Files available | DOI
 

2014 | Conference Paper | IST-REx-ID: 1903
Partial-observation stochastic reachability and parity games
K. Chatterjee, in:, Springer, 2014, pp. 1–4.
View | Files available | DOI
 

2014 | Journal Article | IST-REx-ID: 2211 | OA
Partial-observation stochastic games: How to win when belief fails
K. Chatterjee, L. Doyen, ACM Transactions on Computational Logic (TOCL) 15 (2014).
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2014 | Journal Article | IST-REx-ID: 2038 | OA
Temporal specifications with accumulative values
U. Boker, K. Chatterjee, T.A. Henzinger, O. Kupferman, ACM Transactions on Computational Logic (TOCL) 15 (2014).
[Submitted Version] View | Files available | DOI
 

2014 | Conference Paper | IST-REx-ID: 2162 | OA
The complexity of ergodic mean payoff games
K. Chatterjee, R. Ibsen-Jensen, in:, Springer, 2014, pp. 122–133.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2014 | Conference Paper | IST-REx-ID: 2213 | OA
The complexity of partial-observation stochastic parity games with finite-memory strategies
K. Chatterjee, L. Doyen, S. Nain, M. Vardi, in:, Springer, 2014, pp. 242–257.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2014 | Conference Paper | IST-REx-ID: 2212
Perfect-information stochastic mean-payoff parity games
K. Chatterjee, L. Doyen, H. Gimbert, Y. Oualhadj, in:, Springer, 2014, pp. 210–225.
View | Files available | DOI
 

2014 | Conference Paper | IST-REx-ID: 2216 | OA
Edit distance for timed automata
K. Chatterjee, R. Ibsen-Jensen, R. Majumdar, in:, Springer, 2014, pp. 303–312.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.)
 

2014 | Technical Report | IST-REx-ID: 5413 | OA
CEGAR for qualitative analysis of probabilistic systems
K. Chatterjee, P. Daca, M. Chmelik, CEGAR for Qualitative Analysis of Probabilistic Systems, IST Austria, 2014.
[Published Version] View | Files available | DOI
 

2014 | Technical Report | IST-REx-ID: 5414 | OA
CEGAR for qualitative analysis of probabilistic systems
K. Chatterjee, P. Daca, M. Chmelik, CEGAR for Qualitative Analysis of Probabilistic Systems, IST Austria, 2014.
[Published Version] View | Files available | DOI
 

2014 | Technical Report | IST-REx-ID: 5412 | OA
CEGAR for qualitative analysis of probabilistic systems
K. Chatterjee, P. Daca, M. Chmelik, CEGAR for Qualitative Analysis of Probabilistic Systems, IST Austria, 2014.
[Published Version] View | Files available | DOI
 

2014 | Conference Paper | IST-REx-ID: 2163 | OA
Games with a weak adversary
K. Chatterjee, L. Doyen, in:, Lecture Notes in Computer Science, Springer, 2014, pp. 110–121.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2014 | Technical Report | IST-REx-ID: 5419 | OA
Improved algorithms for reachability and shortest path on low tree-width graphs
K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, Improved Algorithms for Reachability and Shortest Path on Low Tree-Width Graphs, IST Austria, 2014.
[Published Version] View | Files available | DOI
 

2014 | Technical Report | IST-REx-ID: 5418 | OA
Games with a weak adversary
K. Chatterjee, L. Doyen, Games with a Weak Adversary, IST Austria, 2014.
[Published Version] View | Files available | DOI
 

2014 | Technical Report | IST-REx-ID: 5420 | OA
The value 1 problem for concurrent mean-payoff games
K. Chatterjee, R. Ibsen-Jensen, The Value 1 Problem for Concurrent Mean-Payoff Games, IST Austria, 2014.
[Published Version] View | Files available | DOI
 

2014 | Technical Report | IST-REx-ID: 5424 | OA
Qualitative analysis of POMDPs with temporal logic specifications for robotics applications
K. Chatterjee, M. Chmelik, R. Gupta, A. Kanodia, Qualitative Analysis of POMDPs with Temporal Logic Specifications for Robotics Applications, IST Austria, 2014.
[Published Version] View | Files available | DOI
 

2014 | Technical Report | IST-REx-ID: 5426 | OA
Qualitative analysis of POMDPs with temporal logic specifications for robotics applications
K. Chatterjee, M. Chmelik, R. Gupta, A. Kanodia, Qualitative Analysis of POMDPs with Temporal Logic Specifications for Robotics Applications, IST Austria, 2014.
[Published Version] View | Files available | DOI
 

2014 | Technical Report | IST-REx-ID: 5423 | OA
A framework for automated competitive analysis of on-line scheduling of firm-deadline tasks
K. Chatterjee, A. Kössler, A. Pavlogiannis, U. Schmid, A Framework for Automated Competitive Analysis of On-Line Scheduling of Firm-Deadline Tasks, IST Austria, 2014.
[Published Version] View | Files available | DOI
 

2014 | Technical Report | IST-REx-ID: 5427 | OA
Optimal tree-decomposition balancing and reachability on low treewidth graphs
K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, Optimal Tree-Decomposition Balancing and Reachability on Low Treewidth Graphs, IST Austria, 2014.
[Published Version] View | Files available | DOI
 

2014 | Technical Report | IST-REx-ID: 5415 | OA
Nested weighted automata
K. Chatterjee, T.A. Henzinger, J. Otop, Nested Weighted Automata, IST Austria, 2014.
[Published Version] View | Files available | DOI
 

2014 | Technical Report | IST-REx-ID: 5421 | OA
The complexity of evolution on graphs
K. Chatterjee, R. Ibsen-Jensen, M. Nowak, The Complexity of Evolution on Graphs, IST Austria, 2014.
[Published Version] View | Files available | DOI
 

2014 | Conference Paper | IST-REx-ID: 10885
Doomsday equilibria for omega-regular games
K. Chatterjee, L. Doyen, E. Filiot, J.-F. Raskin, in:, VMCAI 2014: Verification, Model Checking, and Abstract Interpretation, Springer Nature, 2014, pp. 78–97.
[Preprint] View | Files available | DOI | arXiv
 

2014 | Journal Article | IST-REx-ID: 2039 | OA
The time scale of evolutionary innovation
K. Chatterjee, A. Pavlogiannis, B. Adlam, M. Nowak, PLoS Computational Biology 10 (2014).
[Published Version] View | Files available | DOI
 

2014 | Research Data Reference | IST-REx-ID: 9739
Detailed proofs for “The time scale of evolutionary innovation”
K. Chatterjee, A. Pavlogiannis, B. Adlam, M. Novak, (2014).
[Published Version] View | Files available | DOI
 

2014 | Journal Article | IST-REx-ID: 535 | OA
Polynomial-time algorithms for energy games with special weight structures
K. Chatterjee, M.H. Henzinger, S. Krinninger, D. Nanongkai, Algorithmica 70 (2014) 457–492.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 

2014 | Conference Paper | IST-REx-ID: 2063
CEGAR for qualitative analysis of probabilistic systems
K. Chatterjee, M. Chmelik, P. Daca, in:, Springer, 2014, pp. 473–490.
View | Files available | DOI
 

2014 | Technical Report | IST-REx-ID: 5428 | OA
Quantitative fair simulation games
K. Chatterjee, T.A. Henzinger, J. Otop, Y. Velner, Quantitative Fair Simulation Games, IST Austria, 2014.
[Published Version] View | Files available | DOI
 

2013 | Conference Paper | IST-REx-ID: 1374 | OA
Infinite-state games with finitary conditions
K. Chatterjee, N. Fijalkow, in:, 22nd EACSL Annual Conference on Computer Science Logic, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013, pp. 181–196.
[Published Version] View | Files available | DOI
 

2013 | Conference Paper | IST-REx-ID: 2238
Multi-objective discounted reward verification in graphs and MDPs
K. Chatterjee, V. Forejt, D. Wojtczak, 8312 (2013) 228–242.
View | DOI
 

2013 | Conference (Editor) | IST-REx-ID: 2292
Mathematical Foundations of Computer Science 2013
K. Chatterjee, J. Sgall, eds., Mathematical Foundations of Computer Science 2013, Springer, 2013.
View | DOI
 

2013 | Journal Article | IST-REx-ID: 2299 | OA
Synthesis of AMBA AHB from formal specification: A case study
Y. Godhal, K. Chatterjee, T.A. Henzinger, International Journal on Software Tools for Technology Transfer 15 (2013) 585–601.
[Submitted Version] View | Files available | DOI
 

2013 | Conference Paper | IST-REx-ID: 2446 | OA
Automata with generalized Rabin pairs for probabilistic model checking and LTL synthesis
K. Chatterjee, A. Gaiser, J. Kretinsky, 8044 (2013) 559–575.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

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

2013 | Journal Article | IST-REx-ID: 2814 | OA
The complexity of coverage
K. Chatterjee, L. Alfaro, R. Majumdar, International Journal of Foundations of Computer Science 24 (2013) 165–185.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

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

2013 | Conference Paper | IST-REx-ID: 2819 | OA
Quantitative timed simulation functions and refinement metrics for real-time systems
K. Chatterjee, V. Prabhu, in:, Proceedings of the 16th International Conference on Hybrid Systems: Computation and Control, Springer, 2013, pp. 273–282.
[Preprint] View | DOI | Download Preprint (ext.)
 

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

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

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

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

Filters and Search Terms

department=KrCh

Search

Filter Publications