Please note that IST 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.

343 Publications


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.
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.
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.
View | Files available | DOI | Download (ext.) | arXiv
 

2014 | Technical Report | IST-REx-ID: 5415
Nested weighted automata
K. Chatterjee, T.A. Henzinger, J. Otop, Nested Weighted Automata, IST Austria, 2014.
View | Files available | 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.
View | Files available | DOI
 

2013 | Journal Article | IST-REx-ID: 2816   OA
Evolutionary dynamics of cancer in response to targeted combination therapy
I. Božić, J. Reiter, B. Allen, T. Antal, K. Chatterjee, P. Shah, Y. Moon, A. Yaqubie, N. Kelly, D. Le, E. Lipson, P. Chapman, L. Diaz, B. Vogelstein, M. Nowak, ELife 2 (2013).
View | Files available | DOI
 

2013 | Technical Report | IST-REx-ID: 5409   OA
Edit distance for timed automata
K. Chatterjee, R. Ibsen-Jensen, R. Majumdar, Edit Distance for Timed Automata, IST Austria, 2013.
View | Files available | DOI
 

2013 | Technical Report | IST-REx-ID: 5404
The complexity of ergodic games
K. Chatterjee, R. Ibsen-Jensen, The Complexity of Ergodic Games, IST Austria, 2013.
View | Files available | DOI
 

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.
View | Files available | 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 | Conference Paper | IST-REx-ID: 1376
Distributed synthesis for LTL fragments
K. Chatterjee, T.A. Henzinger, J. Otop, A. Pavlogiannis, in:, 13th International Conference on Formal Methods in Computer-Aided Design, IEEE, 2013, pp. 18–25.
View | Files available | DOI
 

2013 | Journal Article | IST-REx-ID: 2247   OA
Forgiver triumphs in alternating prisoner's dilemma
B. Zagorsky, J. Reiter, K. Chatterjee, M. Nowak, PLoS One 8 (2013).
View | Files available | DOI
 

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

2013 | Technical Report | IST-REx-ID: 5405
Perfect-information stochastic mean-payoff parity games
K. Chatterjee, L. Doyen, H. Gimbert, Y. Oualhadj, Perfect-Information Stochastic Mean-Payoff Parity Games, IST Austria, 2013.
View | Files available | DOI
 

2013 | Technical Report | IST-REx-ID: 5400
What is decidable about partially observable Markov decision processes with ω-regular objectives
K. Chatterjee, M. Chmelik, M. Tracol, What Is Decidable about Partially Observable Markov Decision Processes with ω-Regular Objectives, IST Austria, 2013.
View | Files available | DOI
 

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.
View | DOI | Download (ext.) | arXiv
 

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.
View | DOI | Download (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.
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.
View | DOI | Download (ext.)
 

2013 | Conference Paper | IST-REx-ID: 2329
Hyperplane separation technique for multidimensional mean-payoff games
K. Chatterjee, Y. Velner, 8052 (2013) 500–515.
View | Files available | DOI | Download (ext.) | arXiv
 

2013 | Journal Article | IST-REx-ID: 2831   OA
Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives
K. Chatterjee, M. Henzinger, M. Joglekar, N. Shah, Formal Methods in System Design 42 (2013) 301–327.
View | Files available | DOI | Download (ext.) | arXiv
 

2013 | Technical Report | IST-REx-ID: 5406
Distributed synthesis for LTL Fragments
K. Chatterjee, T.A. Henzinger, J. Otop, A. Pavlogiannis, Distributed Synthesis for LTL Fragments, IST Austria, 2013.
View | Files available | DOI
 

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

2013 | Conference Paper | IST-REx-ID: 2820
Automated analysis of real-time scheduling using graph games
K. Chatterjee, A. Kößler, U. Schmid, in:, Proceedings of the 16th International Conference on Hybrid Systems: Computation and Control, ACM, 2013, pp. 163–172.
View | Files available | DOI
 

2013 | Technical Report | IST-REx-ID: 5399
TTP: Tool for Tumor Progression
J. Reiter, I. Bozic, K. Chatterjee, M. Nowak, TTP: Tool for Tumor Progression, IST Austria, 2013.
View | Files available | 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.
View | Files available | DOI
 

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.
View | DOI | Download (ext.) | arXiv
 

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.
View | DOI | Download (ext.)
 

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.
View | DOI | Download (ext.) | arXiv
 

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 | Journal Article | IST-REx-ID: 3116
Code aware resource management
K. Chatterjee, L. De Alfaro, M. Faella, R. Majumdar, V. Raman, Formal Methods in System Design 42 (2013) 142–174.
View | DOI
 

2013 | Technical Report | IST-REx-ID: 5403   OA
Qualitative analysis of concurrent mean-payoff games
K. Chatterjee, R. Ibsen-Jensen, Qualitative Analysis of Concurrent Mean-Payoff Games, IST Austria, 2013.
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.
View | Files available | DOI
 

2013 | Conference Paper | IST-REx-ID: 2000   OA
TTP: Tool for tumor progression
J. Reiter, I. Božić, K. Chatterjee, M. Nowak, in:, Proceedings of 25th Int. Conf. on Computer Aided Verification, Springer, 2013, pp. 101–106.
View | Files available | DOI | Download (ext.) | arXiv
 

2013 | Journal Article | IST-REx-ID: 2858   OA
The effect of one additional driver mutation on tumor progression
J. Reiter, I. Božić, B. Allen, K. Chatterjee, M. Nowak, Evolutionary Applications 6 (2013) 34–45.
View | Files available | DOI
 

2013 | Conference Paper | IST-REx-ID: 2295   OA View | Files available | DOI
 

2013 | Technical Report | IST-REx-ID: 5408
The complexity of partial-observation stochastic parity games with finite-memory strategies
K. Chatterjee, L. Doyen, S. Nain, M. Vardi, The Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory Strategies, IST Austria, 2013.
View | Files available | DOI
 

2013 | Technical Report | IST-REx-ID: 5410
Automatic generation of alternative starting positions for traditional board games
U. Ahmed, K. Chatterjee, S. Gulwani, Automatic Generation of Alternative Starting Positions for Traditional Board Games, IST Austria, 2013.
View | Files available | DOI
 

2012 | Technical Report | IST-REx-ID: 5377
Mean-payoff pushdown games
K. Chatterjee, Y. Velner, Mean-Payoff Pushdown Games, IST Austria, 2012.
View | Files available | DOI
 

2012 | Conference Paper | IST-REx-ID: 2955   OA
Partial-observation stochastic games: How to win when belief fails
K. Chatterjee, L. Doyen, in:, Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, IEEE, 2012.
View | Files available | DOI | Download (ext.) | arXiv
 

2012 | Conference Paper | IST-REx-ID: 2936   OA
Finite automata with time delay blocks
K. Chatterjee, T.A. Henzinger, V. Prabhu, in:, Roceedings of the Tenth ACM International Conference on Embedded Software, ACM, 2012, pp. 43–52.
View | DOI | Download (ext.)
 

2012 | Journal Article | IST-REx-ID: 3314
Discounting and averaging in games across time scales
K. Chatterjee, R. Majumdar, International Journal of Foundations of Computer Science 23 (2012) 609–625.
View | DOI
 

2012 | Conference Paper | IST-REx-ID: 496   OA
Interpretations in trees with countably many branches
A. Rabinovich, S. Rubin, in:, IEEE, 2012.
View | DOI | Download (ext.)
 

2012 | Conference Paper | IST-REx-ID: 2715
Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives
K. Chatterjee, M. Joglekar, N. Shah, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012, pp. 461–473.
View | Files available | DOI
 

2012 | Journal Article | IST-REx-ID: 3846   OA
A survey of stochastic ω regular games
K. Chatterjee, T.A. Henzinger, Journal of Computer and System Sciences 78 (2012) 394–413.
View | Files available | DOI
 

2012 | Journal Article | IST-REx-ID: 2848   OA
Evolutionary game dynamics in populations with different learners
K. Chatterjee, D. Zufferey, M. Nowak, Journal of Theoretical Biology 301 (2012) 161–173.
View | DOI | Download (ext.) | PubMed | Europe PMC
 

2012 | Conference Paper | IST-REx-ID: 2956
Mean payoff pushdown games
K. Chatterjee, Y. Velner, in:, Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, IEEE, 2012.
View | Files available | DOI
 

2012 | Conference Paper | IST-REx-ID: 3341   OA
Robustness of structurally equivalent concurrent parity games
K. Chatterjee, in:, Springer, 2012, pp. 270–285.
View | Files available | DOI | Download (ext.) | arXiv
 

2012 | Conference Paper | IST-REx-ID: 3252   OA
Synthesizing protocols for digital contract signing
K. Chatterjee, V. Raman, in:, Springer, 2012, pp. 152–168.
View | DOI | Download (ext.)
 

2012 | Conference Paper | IST-REx-ID: 497   OA
Faster algorithms for alternating refinement relations
K. Chatterjee, S. Chaubal, P. Kamath, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012, pp. 167–182.
View | Files available | DOI
 

2012 | Technical Report | IST-REx-ID: 5378
Faster algorithms for alternating refinement relations
K. Chatterjee, S. Chaubal, P. Kamath, Faster Algorithms for Alternating Refinement Relations, IST Austria, 2012.
View | Files available | DOI
 

2012 | Journal Article | IST-REx-ID: 3157   OA
The molecular evolution of acquired resistance to targeted EGFR blockade in colorectal cancers
L. Diaz Jr, R. Williams, J. Wu, I. Kinde, J. Hecht, J. Berlin, B. Allen, I. Božić, J. Reiter, M. Nowak, K. Kinzler, K. Oliner, B. Vogelstein, Nature 486 (2012) 537–540.
View | Files available | DOI | Download (ext.) | PubMed | Europe PMC
 

2012 | Conference Paper | IST-REx-ID: 2957   OA
Decidable problems for probabilistic automata on infinite words
K. Chatterjee, M. Tracol, in:, Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, IEEE, 2012.
View | Files available | DOI | Download (ext.) | arXiv
 

2012 | Journal Article | IST-REx-ID: 3260   OA
Evolutionary dynamics of biological auctions
K. Chatterjee, J. Reiter, M. Nowak, Theoretical Population Biology 81 (2012) 69–80.
View | Files available | DOI | Download (ext.) | PubMed | Europe PMC
 

2012 | Journal Article | IST-REx-ID: 2972   OA
Energy parity games
K. Chatterjee, L. Doyen, Theoretical Computer Science 458 (2012) 49–60.
View | Files available | DOI | arXiv
 

2012 | Conference Paper | IST-REx-ID: 3165
An O(n2) time algorithm for alternating Büchi games
K. Chatterjee, M. Henzinger, in:, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, 2012, pp. 1386–1399.
View | Files available | DOI
 

2012 | Journal Article | IST-REx-ID: 3254
The complexity of stochastic Müller games
K. Chatterjee, Information and Computation 211 (2012) 29–48.
View | DOI | Download (ext.)
 

2012 | Conference Paper | IST-REx-ID: 2916   OA
Interface Simulation Distances
P. Cerny, M. Chmelik, T.A. Henzinger, A. Radhakrishna, in:, Electronic Proceedings in Theoretical Computer Science, EPTCS, 2012, pp. 29–42.
View | Files available | DOI | Download (ext.) | arXiv
 

2012 | Conference Paper | IST-REx-ID: 2947   OA
Equivalence of games with probabilistic uncertainty and partial observation games
K. Chatterjee, M. Chmelik, R. Majumdar, in:, Springer, 2012, pp. 385–399.
View | DOI | Download (ext.)
 

2012 | Journal Article | IST-REx-ID: 3128   OA
A survey of partial-observation stochastic parity games
K. Chatterjee, L. Doyen, T.A. Henzinger, Formal Methods in System Design 43 (2012) 268–284.
View | Files available | DOI
 

2012 | Conference Paper | IST-REx-ID: 3135   OA
Efficient controller synthesis for consumption games with multiple resource types
B. Brázdil, K. Chatterjee, A. Kučera, P. Novotny, in:, Springer, 2012, pp. 23–38.
View | DOI | Download (ext.)
 

2012 | Conference Paper | IST-REx-ID: 495   OA
A Myhill Nerode theorem for automata with advice
A. Kruckman, S. Rubin, J. Sheridan, B. Zax, in:, Proceedings GandALF 2012, Open Publishing Association, 2012, pp. 238–246.
View | Files available | DOI
 

2012 | Conference Paper | IST-REx-ID: 3255   OA
Games and Markov decision processes with mean payoff parity and energy parity objectives
K. Chatterjee, L. Doyen, in:, Springer, 2012, pp. 37–46.
View | Files available | DOI
 

2011 | Conference Paper | IST-REx-ID: 3357
The complexity of request-response games
K. Chatterjee, T.A. Henzinger, F. Horn, in:, A.-H. Dediu, S. Inenaga, C. Martín-Vide (Eds.), Springer, 2011, pp. 227–237.
View | DOI
 

2011 | Preprint | IST-REx-ID: 3338
Bounded rationality in concurrent parity games
K. Chatterjee, ArXiv (2011) 1–51.
View | Files available | Download (ext.) | arXiv
 

2011 | Technical Report | IST-REx-ID: 5384
Decidable problems for probabilistic automata on infinite words
K. Chatterjee, M. Tracol, Decidable Problems for Probabilistic Automata on Infinite Words, IST Austria, 2011.
View | Files available | DOI
 

2011 | Conference Paper | IST-REx-ID: 3345   OA
Energy and mean-payoff parity Markov Decision Processes
K. Chatterjee, L. Doyen, in:, Springer, 2011, pp. 206–218.
View | Files available | DOI | Download (ext.) | arXiv
 

2011 | Preprint | IST-REx-ID: 3339   OA View | Download (ext.) | arXiv
 

2011 | Conference Paper | IST-REx-ID: 3365   OA
QUASY: quantitative synthesis tool
K. Chatterjee, T.A. Henzinger, B. Jobstmann, R. Singh, in:, Springer, 2011, pp. 267–271.
View | Files available | DOI
 

2011 | Journal Article | IST-REx-ID: 3315
Timed parity games: Complexity and robustness
K. Chatterjee, T.A. Henzinger, V. Prabhu, Logical Methods in Computer Science 7 (2011).
View | Files available | DOI
 

2011 | Technical Report | IST-REx-ID: 5380   OA
Bounded rationality in concurrent parity games
K. Chatterjee, Bounded Rationality in Concurrent Parity Games, IST Austria, 2011.
View | Files available | DOI
 

2011 | Conference Paper | IST-REx-ID: 3346   OA
Two views on multiple mean payoff objectives in Markov Decision Processes
T. Brázdil, V. Brožek, K. Chatterjee, V. Forejt, A. Kučera, in:, IEEE, 2011.
View | DOI | Download (ext.)
 

2011 | Technical Report | IST-REx-ID: 5385
Temporal specifications with accumulative values
U. Boker, K. Chatterjee, T.A. Henzinger, O. Kupferman, Temporal Specifications with Accumulative Values, IST Austria, 2011.
View | Files available | DOI
 

2011 | Technical Report | IST-REx-ID: 5381
Partial-observation stochastic games: How to win when belief fails
K. Chatterjee, L. Doyen, Partial-Observation Stochastic Games: How to Win When Belief Fails, IST Austria, 2011.
View | Files available | DOI
 

2011 | Conference Paper | IST-REx-ID: 3366   OA
Quantitative synthesis for concurrent programs
P. Cerny, K. Chatterjee, T.A. Henzinger, A. Radhakrishna, R. Singh, in:, G. Gopalakrishnan, S. Qadeer (Eds.), Springer, 2011, pp. 243–259.
View | Files available | DOI
 

2011 | Conference Paper | IST-REx-ID: 3361   OA
The complexity of quantitative information flow problems
P. Cerny, K. Chatterjee, T.A. Henzinger, in:, IEEE, 2011, pp. 205–217.
View | Files available | DOI
 

2011 | Conference Paper | IST-REx-ID: 3347   OA
Finitary languages
K. Chatterjee, N. Fijalkow, in:, Springer, 2011, pp. 216–226.
View | DOI | Download (ext.) | arXiv
 

2011 | Journal Article | IST-REx-ID: 3354
Qualitative concurrent parity games
K. Chatterjee, L. De Alfaro, T.A. Henzinger, ACM Transactions on Computational Logic (TOCL) 12 (2011).
View | Files available | DOI
 

2011 | Technical Report | IST-REx-ID: 5379
An O(n2) time algorithm for alternating Büchi games
K. Chatterjee, M. Henzinger, An O(N2) Time Algorithm for Alternating Büchi Games, IST Austria, 2011.
View | Files available | DOI
 

2011 | Conference Paper | IST-REx-ID: 3342
Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives
K. Chatterjee, M. Henzinger, M. Joglekar, S. Nisarg, in:, G. Gopalakrishnan, S. Qadeer (Eds.), Springer, 2011, pp. 260–276.
View | Files available | DOI | Download (ext.) | arXiv
 

2011 | Conference Paper | IST-REx-ID: 3316   OA
Specification-centered robustness
R. Bloem, K. Chatterjee, K. Greimel, T.A. Henzinger, B. Jobstmann, in:, 6th IEEE International Symposium on Industrial and Embedded Systems, IEEE, 2011, pp. 176–185.
View | DOI | Download (ext.)
 

2011 | Conference Paper | IST-REx-ID: 3343   OA View | DOI | Download (ext.)
 

2011 | Conference Paper | IST-REx-ID: 3348   OA
Synthesis of memory efficient real time controllers for safety objectives
K. Chatterjee, V. Prabhu, in:, Springer, 2011, pp. 221–230.
View | DOI | Download (ext.)
 

2011 | Conference Paper | IST-REx-ID: 3350
Minimum attention controller synthesis for omega regular objectives
K. Chatterjee, R. Majumdar, in:, U. Fahrenberg, S. Tripakis (Eds.), Springer, 2011, pp. 145–159.
View | DOI
 

2011 | Technical Report | IST-REx-ID: 5382
Robustness of structurally equivalent concurrent parity games
K. Chatterjee, Robustness of Structurally Equivalent Concurrent Parity Games, IST Austria, 2011.
View | Files available | DOI
 

2011 | Technical Report | IST-REx-ID: 5387
Energy and mean-payoff parity Markov decision processes
K. Chatterjee, L. Doyen, Energy and Mean-Payoff Parity Markov Decision Processes, IST Austria, 2011.
View | Files available | DOI
 

2011 | Conference Paper | IST-REx-ID: 3344
Graph games with reachability objectives
K. Chatterjee, in:, G. Delzanno, I. Potapov (Eds.), Springer, 2011, pp. 1–1.
View | DOI
 

2011 | Preprint | IST-REx-ID: 3363   OA
The decidability frontier for probabilistic automata on infinite words
K. Chatterjee, T.A. Henzinger, M. Tracol, (n.d.).
View | Download (ext.) | arXiv
 

2011 | Conference Paper | IST-REx-ID: 3349   OA
A reduction from parity games to simple stochastic games
K. Chatterjee, N. Fijalkow, in:, EPTCS, 2011, pp. 74–86.
View | DOI | Download (ext.)
 

2011 | Conference Paper | IST-REx-ID: 3351   OA
On memoryless quantitative objectives
K. Chatterjee, L. Doyen, R. Singh, in:, O. Owe, M. Steffen, J.A. Telle (Eds.), Springer, 2011, pp. 148–159.
View | DOI | Download (ext.)
 

2011 | Conference Paper | IST-REx-ID: 3356
Temporal specifications with accumulative values
U. Boker, K. Chatterjee, T.A. Henzinger, O. Kupferman, in:, IEEE, 2011.
View | Files available | DOI
 

2010 | Conference Paper | IST-REx-ID: 3852   OA
Discounting in games across time scales
K. Chatterjee, R. Majumdar, in:, EPTCS, 2010, pp. 22–29.
View | Files available | DOI | arXiv
 

2010 | Conference Paper | IST-REx-ID: 489   OA
How do we remember the past in randomised strategies?
J. Cristau, C. David, F. Horn, in:, Proceedings of GandALF 2010, Open Publishing Association, 2010, pp. 30–39.
View | DOI | Download (ext.)
 

2010 | Conference Paper | IST-REx-ID: 3857
Probabilistic Automata on infinite words: decidability and undecidability results
K. Chatterjee, T.A. Henzinger, in:, Springer, 2010, pp. 1–16.
View | Files available | DOI
 

2010 | Conference Paper | IST-REx-ID: 3864
Measuring and synthesizing systems in probabilistic environments
K. Chatterjee, T.A. Henzinger, B. Jobstmann, R. Singh, in:, Springer, 2010, pp. 380–395.
View | Files available | DOI | Download (ext.)
 

2010 | Conference Paper | IST-REx-ID: 3853   OA
Mean-payoff automaton expressions
K. Chatterjee, L. Doyen, H. Edelsbrunner, T.A. Henzinger, P. Rannou, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 269–283.
View | Files available | DOI
 

2010 | Conference Paper | IST-REx-ID: 3865
Analyzing the impact of change in multi-threaded programs
K. Chatterjee, L. De Alfaro, V. Raman, C. Sánchez, in:, D. Rosenblum, G. Taenzer (Eds.), Springer, 2010, pp. 293–307.
View | DOI
 

2010 | Conference Paper | IST-REx-ID: 3860   OA
Generalized mean-payoff and energy games
K. Chatterjee, L. Doyen, T.A. Henzinger, J. Raskin, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 505–516.
View | Files available | DOI
 

2010 | Conference Paper | IST-REx-ID: 3858   OA
The complexity of partial-observation parity games
K. Chatterjee, L. Doyen, in:, Springer, 2010, pp. 1–14.
View | Files available | DOI
 

Filters and Search Terms

department=KrCh

Search

Filter Publications

Display / Sort

Citation Style: Default

Export / Embed