Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Krishnendu Chatterjee
2010 – today
- 2013
[j25]Krishnendu Chatterjee, Luca de Alfaro, Marco Faella, Rupak Majumdar, Vishwanath Raman: Code aware resource management. Formal Methods in System Design 42(2): 146-174 (2013)- [j24]Krishnendu Chatterjee, Monika Henzinger, Manas Joglekar, Nisarg Shah: Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives. Formal Methods in System Design 42(3): 301-327 (2013)
- [j23]Krishnendu Chatterjee, Luca de Alfaro, Thomas A. Henzinger: Strategy improvement for concurrent reachability and turn-based stochastic safety games. J. Comput. Syst. Sci. 79(5): 640-657 (2013)
- [c101]Krishnendu Chatterjee, Alexander Kößler, Ulrich Schmid: Automated analysis of real-time scheduling using graph games. HSCC 2013: 163-172
- [c100]Krishnendu Chatterjee, Vinayak S. Prabhu: Quantitative timed simulation functions and refinement metrics for real-time systems. HSCC 2013: 273-282
- [c99]Krishnendu Chatterjee, Siddhesh Chaubal, Sasha Rubin: How to Travel between Languages. LATA 2013: 214-225
- [i58]Krishnendu Chatterjee, Nathanaël Fijalkow: Infinite-state games with finitary conditions. CoRR abs/1301.2661 (2013)
- [i57]Krishnendu Chatterjee, Laurent Doyen, Mickael Randour, Jean-François Raskin: Looking at Mean-Payoff and Total-Payoff through Windows. CoRR abs/1302.4248 (2013)
- [i56]Johannes G. Reiter, Ivana Bozic, Krishnendu Chatterjee, Martin A. Nowak: TTP: Tool for Tumor Progression. CoRR abs/1303.5251 (2013)
- [i55]Krishnendu Chatterjee, Jakub Lacki: Faster Algorithms for Markov Decision Processes with Low Treewidth. CoRR abs/1304.0084 (2013)
- [i54]Krishnendu Chatterjee, Andreas Gaiser, Jan Kretínský: Automata with Generalized Rabin Pairs for Probabilistic Model Checking and LTL Synthesis. CoRR abs/1304.5281 (2013)
- [i53]Tomás Brázdil, Krishnendu Chatterjee, Vojtech Forejt, Antonín Kucera: Trading Performance for Stability in Markov Decision Processes. CoRR abs/1305.4103 (2013)
- 2012
- [j22]
- [j21]Krishnendu Chatterjee, Rupak Majumdar: Discounting and Averaging in Games across Time scales. Int. J. Found. Comput. Sci. 23(3): 609-625 (2012)
- [j20]Krishnendu Chatterjee, Thomas A. Henzinger: A survey of stochastic ω-regular games. J. Comput. Syst. Sci. 78(2): 394-413 (2012)
- [j19]
- [j18]Krishnendu Chatterjee, Suneet Tuli: Image Enhancement in Transient Lock-In Thermography Through Time Series Reconstruction and Spatial Slope Correction. IEEE T. Instrumentation and Measurement 61(4): 1079-1089 (2012)
- [c98]Krishnendu Chatterjee, Martin Chmelik, Rupak Majumdar: Equivalence of Games with Probabilistic Uncertainty and Partial-Observation Games. ATVA 2012: 385-399
- [c97]Tomás Brázdil, Krishnendu Chatterjee, Antonín Kucera, Petr Novotný: Efficient Controller Synthesis for Consumption Games with Multiple Resource Types. CAV 2012: 23-38
- [c96]Krishnendu Chatterjee, Mickael Randour, Jean-François Raskin: Strategy Synthesis for Multi-Dimensional Quantitative Objectives. CONCUR 2012: 115-131
- [c95]Krishnendu Chatterjee, Siddhesh Chaubal, Pritish Kamath: Faster Algorithms for Alternating Refinement Relations. CSL 2012: 167-182
- [c94]Krishnendu Chatterjee, Thomas A. Henzinger, Vinayak S. Prabhu: Finite automata with time-delay blocks. EMSOFT 2012: 43-52
- [c93]Krishnendu Chatterjee, Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai: Polynomial-Time Algorithms for Energy Games with Special Weight Structures. ESA 2012: 301-312
- [c92]Krishnendu Chatterjee: Robustness of Structurally Equivalent Concurrent Parity Games. FoSSaCS 2012: 270-285
- [c91]Krishnendu Chatterjee, Manas Joglekar, Nisarg Shah: Average Case Analysis of the Classical Algorithm for Markov Decision Processes with Büchi Objectives. FSTTCS 2012: 461-473
- [c90]Krishnendu Chatterjee, Laurent Doyen: Partial-Observation Stochastic Games: How to Win When Belief Fails. LICS 2012: 175-184
- [c89]Krishnendu Chatterjee, Mathieu Tracol: Decidable Problems for Probabilistic Automata on Infinite Words. LICS 2012: 185-194
- [c88]
- [c87]Krishnendu Chatterjee, Rasmus Ibsen-Jensen: Strategy Complexity of Finite-Horizon Markov Decision Processes and Simple Stochastic Games. MEMICS 2012: 106-117
- [c86]Krishnendu Chatterjee, Monika Henzinger: An O(n2) time algorithm for alternating Büchi games. SODA 2012: 1386-1399
- [c85]Krishnendu Chatterjee, Vishwanath Raman: Synthesizing Protocols for Digital Contract Signing. VMCAI 2012: 152-168
- [i52]
- [i51]Krishnendu Chatterjee, Luca de Alfaro, Thomas A. Henzinger: Strategy Improvement for Concurrent Reachability and Safety Games. CoRR abs/1201.2834 (2012)
- [i50]Krishnendu Chatterjee, Siddhesh Chaubal, Pritish Kamath: Faster Algorithms for Alternating Refinement Relations. CoRR abs/1201.4449 (2012)
- [i49]Krishnendu Chatterjee, Mickael Randour, Jean-François Raskin: Strategy Synthesis for Multi-dimensional Quantitative Objectives. CoRR abs/1201.5073 (2012)
- [i48]Tomás Brázdil, Krishnendu Chatterjee, Antonín Kucera, Petr Novotný: Efficient Controller Synthesis for Consumption Games with Multiple Resource Types. CoRR abs/1202.0796 (2012)
- [i47]Krishnendu Chatterjee, Martin Chmelik, Rupak Majumdar: Equivalence of Games with Probabilistic Uncertainty and Partial-observation Games. CoRR abs/1202.4140 (2012)
- [i46]Krishnendu Chatterjee, Manas Joglekar, Nisarg Shah: Average Case Analysis of the Classical Algorithm for Markov Decision Processes with Büchi Objectives. CoRR abs/1202.4175 (2012)
- [i45]Krishnendu Chatterjee, Nir Piterman: Obligation Blackwell Games and p-Automata. CoRR abs/1206.5174 (2012)
- [i44]Krishnendu Chatterjee, Thomas A. Henzinger, Ranjit Jhala, Rupak Majumdar: Counterexample-guided Planning. CoRR abs/1207.1373 (2012)
- [i43]Krishnendu Chatterjee, Thomas A. Henzinger, Vinayak S. Prabhu: Finite Automata with Time-Delay Blocks (Extended Version). CoRR abs/1207.7019 (2012)
- [i42]Yaron Velner, Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger, Alexander Rabinovich, Jean-François Raskin: The Complexity of Multi-Mean-Payoff and Multi-Energy Games. CoRR abs/1209.3234 (2012)
- [i41]Krishnendu Chatterjee, Rasmus Ibsen-Jensen: Strategy complexity of finite-horizon Markov decision processes and simple stochastic games. CoRR abs/1209.3617 (2012)
- [i40]Krishnendu Chatterjee, Yaron Velner: Finite-State and Pushdown Games with Multi-dimensional Mean-Payoff Objectives. CoRR abs/1210.3141 (2012)
- [i39]Krishnendu Chatterjee, Vinayak S. Prabhu: Quantitative Timed Simulation Functions and Refinement Metrics for Timed Systems (Full Version). CoRR abs/1212.6556 (2012)
- [i38]Nikolaj Bjørner, Krishnendu Chatterjee, Laura Kovács, Rupak Majumdar: Games and Decisions for Rigorous Systems Engineering (Dagstuhl Seminar 12461). Dagstuhl Reports 2(11): 45-65 (2012)
- 2011
- [j17]Krishnendu Chatterjee, Thomas A. Henzinger, Vinayak S. Prabhu: Timed Parity Games: Complexity and Robustness. Logical Methods in Computer Science 7(4) (2011)
- [j16]Krishnendu Chatterjee, Luca de Alfaro, Thomas A. Henzinger: Qualitative concurrent parity games. ACM Trans. Comput. Log. 12(4): 28 (2011)
- [c84]Pavol Cerný, Krishnendu Chatterjee, Thomas A. Henzinger, Arjun Radhakrishna, Rohit Singh: Quantitative Synthesis for Concurrent Programs. CAV 2011: 243-259
- [c83]Krishnendu Chatterjee, Monika Henzinger, Manas Joglekar, Nisarg Shah: Symbolic Algorithms for Qualitative Analysis of Markov Decision Processes with Büchi Objectives. CAV 2011: 260-276
- [c82]Pavol Cerný, Krishnendu Chatterjee, Thomas A. Henzinger: The Complexity of Quantitative Information Flow Problems. CSF 2011: 205-217
- [c81]Krishnendu Chatterjee, Laurent Doyen, Rohit Singh: On Memoryless Quantitative Objectives. FCT 2011: 148-159
- [c80]Krishnendu Chatterjee, Rupak Majumdar: Minimum Attention Controller Synthesis for Omega-Regular Objectives. FORMATS 2011: 145-159
- [c79]Krishnendu Chatterjee, Vinayak S. Prabhu: Synthesis of memory-efficient "real-time" controllers for safety objectives. HSCC 2011: 221-230
- [c78]
- [c77]Krishnendu Chatterjee, Thomas A. Henzinger, Florian Horn: The Complexity of Request-Response Games. LATA 2011: 227-237
- [c76]Tomás Brázdil, Václav Brozek, Krishnendu Chatterjee, Vojtech Forejt, Antonín Kucera: Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes. LICS 2011: 33-42
- [c75]Udi Boker, Krishnendu Chatterjee, Thomas A. Henzinger, Orna Kupferman: Temporal Specifications with Accumulative Values. LICS 2011: 43-52
- [c74]Krishnendu Chatterjee, Laurent Doyen: Games and Markov Decision Processes with Mean-Payoff Parity and Energy Parity Objectives. MEMICS 2011: 37-46
- [c73]Krishnendu Chatterjee, Laurent Doyen: Energy and Mean-Payoff Parity Markov Decision Processes. MFCS 2011: 206-218
- [c72]
- [c71]Roderick Bloem, Krishnendu Chatterjee, Karin Greimel, Thomas A. Henzinger, Barbara Jobstmann: Specification-centered robustness. SIES 2011: 176-185
- [c70]Krishnendu Chatterjee, Monika Henzinger: Faster and Dynamic Algorithms for Maximal End-Component Decomposition and Related Graph Problems in Probabilistic Verification. SODA 2011: 1318-1336
- [c69]Krishnendu Chatterjee, Thomas A. Henzinger, Barbara Jobstmann, Rohit Singh: QUASY: Quantitative Synthesis Tool. TACAS 2011: 267-271
- [c68]Krishnendu Chatterjee, Nathanaël Fijalkow: A reduction from parity games to simple stochastic games. GandALF 2011: 74-86
- [i37]
- [i36]Krishnendu Chatterjee, Vinayak S. Prabhu: Synthesis of Memory-Efficient Real-Time Controllers for Safety Objectives (Full Version). CoRR abs/1101.5842 (2011)
- [i35]Krishnendu Chatterjee, Thomas A. Henzinger, Mathieu Tracol: The Decidability Frontier for Probabilistic Automata on Infinite Words. CoRR abs/1104.0127 (2011)
- [i34]Krishnendu Chatterjee, Laurent Doyen: Energy and Mean-Payoff Parity Markov Decision Processes. CoRR abs/1104.2909 (2011)
- [i33]Krishnendu Chatterjee, Laurent Doyen, Rohit Singh: On Memoryless Quantitative Objectives. CoRR abs/1104.3211 (2011)
- [i32]Krishnendu Chatterjee, Monika Henzinger, Manas Joglekar, Nisarg Shah: Symbolic Algorithms for Qualitative Analysis of Markov Decision Processes with Büchi Objectives. CoRR abs/1104.3348 (2011)
- [i31]Tomás Brázdil, Václav Brozek, Krishnendu Chatterjee, Vojtech Forejt, Antonín Kucera: Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes. CoRR abs/1104.3489 (2011)
- [i30]Pavol Cerný, Krishnendu Chatterjee, Thomas A. Henzinger, Arjun Radhakrishna, Rohit Singh: Quantitative Synthesis for Concurrent Programs. CoRR abs/1104.4306 (2011)
- [i29]Krishnendu Chatterjee: Robustness of Structurally Equivalent Concurrent Parity Games. CoRR abs/1107.2009 (2011)
- [i28]Krishnendu Chatterjee, Mathieu Tracol: Decidable Problems for Probabilistic Automata on Infinite Words. CoRR abs/1107.2091 (2011)
- [i27]Krishnendu Chatterjee, Luca de Alfaro, Pritam Roy: Magnifying Lens Abstraction for Stochastic Games with Discounted and Long-run Average Objectives. CoRR abs/1107.2132 (2011)
- [i26]Krishnendu Chatterjee, Laurent Doyen: Partial-Observation Stochastic Games: How to Win when Belief Fails. CoRR abs/1107.2141 (2011)
- [i25]
- [i24]Krishnendu Chatterjee, Monika Henzinger: An O(n^2) Time Algorithm for Alternating Büchi Games. CoRR abs/1109.5018 (2011)
- 2010
- [j15]Krishnendu Chatterjee, Luca de Alfaro, Rupak Majumdar, Vishwanath Raman: Algorithms for Game Metrics (Full Version). Logical Methods in Computer Science 6(3) (2010)
- [j14]Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger: Expressiveness and Closure Properties for Quantitative Languages. Logical Methods in Computer Science 6(3) (2010)
- [j13]Krishnendu Chatterjee, Thomas A. Henzinger, Nir Piterman: Strategy logic. Inf. Comput. 208(6): 677-693 (2010)
- [j12]Dietmar Berwanger, Krishnendu Chatterjee, Martin De Wulf, Laurent Doyen, Thomas A. Henzinger: Strategy construction for parity games with imperfect information. Inf. Comput. 208(10): 1206-1220 (2010)
- [j11]Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger: Quantitative languages. ACM Trans. Comput. Log. 11(4) (2010)
- [c67]Krishnendu Chatterjee, Thomas A. Henzinger: Probabilistic Automata on Infinite Words: Decidability and Undecidability Results. ATVA 2010: 1-16
- [c66]Krishnendu Chatterjee, Thomas A. Henzinger, Barbara Jobstmann, Rohit Singh: Measuring and Synthesizing Systems in Probabilistic Environments. CAV 2010: 380-395
- [c65]Roderick Bloem, Krishnendu Chatterjee, Karin Greimel, Thomas A. Henzinger, Barbara Jobstmann: Robustness in the Presence of Liveness. CAV 2010: 410-424
- [c64]Krishnendu Chatterjee, Thomas A. Henzinger, Barbara Jobstmann, Arjun Radhakrishna: Gist: A Solver for Probabilistic Games. CAV 2010: 665-669
- [c63]Krishnendu Chatterjee, Laurent Doyen, Herbert Edelsbrunner, Thomas A. Henzinger, Philippe Rannou: Mean-Payoff Automaton Expressions. CONCUR 2010: 269-283
- [c62]
- [c61]Krishnendu Chatterjee, Luca de Alfaro, Vishwanath Raman, César Sánchez: Analyzing the Impact of Change in Multi-threaded Programs. FASE 2010: 293-307
- [c60]Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger, Jean-François Raskin: Generalized Mean-payoff and Energy Games. FSTTCS 2010: 505-516
- [c59]
- [c58]Krishnendu Chatterjee, Laurent Doyen: The Complexity of Partial-Observation Parity Games. LPAR (Yogyakarta) 2010: 1-14
- [c57]Krishnendu Chatterjee, Laurent Doyen, Hugo Gimbert, Thomas A. Henzinger: Randomness for Free. MFCS 2010: 246-257
- [c56]Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger: Qualitative Analysis of Partially-Observable Markov Decision Processes. MFCS 2010: 258-269
- [c55]
- [e1]Krishnendu Chatterjee, Thomas A. Henzinger (Eds.): Formal Modeling and Analysis of Timed Systems - 8th International Conference, FORMATS 2010, Klosterneuburg, Austria, September 8-10, 2010. Proceedings. Lecture Notes in Computer Science 6246, Springer 2010, ISBN 978-3-642-15296-2
- [i23]Yashdeep Godhal, Krishnendu Chatterjee, Thomas A. Henzinger: Synthesis of AMBA AHB from Formal Specification. CoRR abs/1001.2811 (2010)
- [i22]
- [i21]Krishnendu Chatterjee, Thomas A. Henzinger, Barbara Jobstmann, Rohit Singh: Measuring and Synthesizing Systems in Probabilistic Environments. CoRR abs/1004.0739 (2010)
- [i20]Krishnendu Chatterjee, Thomas A. Henzinger, Barbara Jobstmann, Arjun Radhakrishna: GIST: A Solver for Probabilistic Games. CoRR abs/1004.2367 (2010)
- [i19]Krishnendu Chatterjee, Vishwanath Raman: Assume-Guarantee Synthesis for Digital Contract Signing. CoRR abs/1004.2697 (2010)
- [i18]Krishnendu Chatterjee, Laurent Doyen, Hugo Gimbert, Thomas A. Henzinger: Randomness for Free. CoRR abs/1006.0673 (2010)
- [i17]Krishnendu Chatterjee, Laurent Doyen, Herbert Edelsbrunner, Thomas A. Henzinger, Philippe Rannou: Mean-payoff Automaton Expressions. CoRR abs/1006.1492 (2010)
- [i16]Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger, Jean-François Raskin: Generalized Mean-payoff and Energy Games. CoRR abs/1007.1669 (2010)
2000 – 2009
- 2009
- [j10]Krishnendu Chatterjee, Luca de Alfaro, Marco Faella, Axel Legay: Qualitative Logics and Equivalences for Probabilistic Systems. Logical Methods in Computer Science 5(2) (2009)
- [j9]Krishnendu Chatterjee, Thomas A. Henzinger, Florian Horn: Finitary winning in omega-regular games. ACM Trans. Comput. Log. 11(1) (2009)
- [c54]Roderick Bloem, Krishnendu Chatterjee, Thomas A. Henzinger, Barbara Jobstmann: Better Quality in Synthesis through Quantitative Objectives. CAV 2009: 140-156
- [c53]Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger: Probabilistic Weighted Automata. CONCUR 2009: 244-258
- [c52]Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger: Alternating Weighted Automata. FCT 2009: 3-13
- [c51]Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger: A Survey of Stochastic Games with Limsup and Liminf Objectives. ICALP (2) 2009: 1-15
- [c50]Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger: Expressiveness and Closure Properties for Quantitative Languages. LICS 2009: 199-208
- [c49]Krishnendu Chatterjee, Thomas A. Henzinger, Florian Horn: Stochastic Games with Finitary Objectives. MFCS 2009: 34-54
- [c48]Krishnendu Chatterjee, Luca de Alfaro, Thomas A. Henzinger: Termination criteria for solving concurrent safety and reachability games. SODA 2009: 197-206
- [c47]Dietmar Berwanger, Krishnendu Chatterjee, Martin De Wulf, Laurent Doyen, Thomas A. Henzinger: Alpaga: A Tool for Solving Parity Games with Imperfect Information. TACAS 2009: 58-61
- [i15]Dietmar Berwanger, Krishnendu Chatterjee, Martin De Wulf, Laurent Doyen, Thomas A. Henzinger: Alpaga: A Tool for Solving Parity Games with Imperfect Information. CoRR abs/0901.4728 (2009)
- [i14]Roderick Bloem, Krishnendu Chatterjee, Thomas A. Henzinger, Barbara Jobstmann: Better Quality in Synthesis through Quantitative Objectives. CoRR abs/0904.2638 (2009)
- [i13]Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger: Expressiveness and Closure Properties for Quantitative Languages. CoRR abs/0905.2195 (2009)
- [i12]Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger: Qualitative Analysis of Partially-observable Markov Decision Processes. CoRR abs/0909.1645 (2009)
- [i11]Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger: Probabilistic Weighted Automata. CoRR abs/0909.1647 (2009)
- 2008
- [j8]Krishnendu Chatterjee, Rupak Majumdar, Thomas A. Henzinger: Stochastic limit-average games are in EXPTIME. Int. J. Game Theory 37(2): 219-234 (2008)
- [j7]Krishnendu Chatterjee, Thomas A. Henzinger: Reduction of stochastic parity to stochastic mean-payoff games. Inf. Process. Lett. 106(1): 1-7 (2008)
- [c46]Krishnendu Chatterjee, Luca de Alfaro, Rupak Majumdar: The Complexity of Coverage. APLAS 2008: 91-106
- [c45]
- [c44]Krishnendu Chatterjee, Thomas A. Henzinger, Barbara Jobstmann: Environment Assumptions for Synthesis. CONCUR 2008: 147-161
- [c43]Dietmar Berwanger, Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger, Sangram Raje: Strategy Construction for Parity Games with Imperfect Information. CONCUR 2008: 325-339
- [c42]Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger: Quantitative Languages. CSL 2008: 385-400
- [c41]Krishnendu Chatterjee, Arkadeb Ghosal, Thomas A. Henzinger, Daniel T. Iercan, Christoph M. Kirsch, Claudio Pinello, Alberto L. Sangiovanni-Vincentelli: Logical Reliability of Interacting Real-Time Tasks. DATE 2008: 909-914
- [c40]Krishnendu Chatterjee, Thomas A. Henzinger, Vinayak S. Prabhu: Timed Parity Games: Complexity and Robustness. FORMATS 2008: 124-140
- [c39]Krishnendu Chatterjee, Koushik Sen, Thomas A. Henzinger: Model-Checking omega-Regular Properties of Interval Markov Chains. FoSSaCS 2008: 302-317
- [c38]Krishnendu Chatterjee, Luca de Alfaro, Rupak Majumdar, Vishwanath Raman: Algorithms for Game Metrics. FSTTCS 2008: 107-118
- [c37]Krishnendu Chatterjee, Rupak Majumdar, Thomas A. Henzinger: Controller Synthesis with Budget Constraints. HSCC 2008: 72-86
- [c36]Krishnendu Chatterjee, Thomas A. Henzinger, Vinayak S. Prabhu: Trading Infinite Memory for Uniform Randomness in Timed Games. HSCC 2008: 87-100
- [c35]Krishnendu Chatterjee, Thomas A. Henzinger: Value Iteration. 25 Years of Model Checking 2008: 107-138
- [c34]B. Thomas Adler, Krishnendu Chatterjee, Luca de Alfaro, Marco Faella, Ian Pye, Vishwanath Raman: Assigning trust to Wikipedia content. Int. Sym. Wikis 2008
- [i10]Krishnendu Chatterjee, Luca de Alfaro, Rupak Majumdar: The Complexity of Coverage. CoRR abs/0804.4525 (2008)
- [i9]Krishnendu Chatterjee, Luca de Alfaro, Thomas A. Henzinger: Strategy Improvement for Concurrent Safety Games. CoRR abs/0804.4530 (2008)
- [i8]
- [i7]Krishnendu Chatterjee, Thomas A. Henzinger, Nir Piterman: Algorithms for Büchi Games. CoRR abs/0805.2620 (2008)
- [i6]Krishnendu Chatterjee, Rupak Majumdar, Thomas A. Henzinger: Stochastic Limit-Average Games are in EXPTIME. CoRR abs/0805.2622 (2008)
- [i5]Krishnendu Chatterjee, Thomas A. Henzinger, Barbara Jobstmann: Environment Assumptions for Synthesis. CoRR abs/0805.4167 (2008)
- [i4]Krishnendu Chatterjee, Thomas A. Henzinger, Vinayak S. Prabhu: Timed Parity Games: Complexity and Robustness. CoRR abs/0807.1165 (2008)
- [i3]Krishnendu Chatterjee, Thomas A. Henzinger: Probabilistic Systems with LimSup and LimInf Objectives. CoRR abs/0809.1465 (2008)
- [i2]Krishnendu Chatterjee, Luca de Alfaro, Thomas A. Henzinger: Termination Criteria for Solving Concurrent Safety and Reachability Games. CoRR abs/0809.4017 (2008)
- 2007
- [j6]Jean-François Raskin, Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger: Algorithms for Omega-Regular Games with Imperfect Information. Logical Methods in Computer Science 3(3) (2007)
- [j5]Krishnendu Chatterjee: Concurrent games with tail objectives. Theor. Comput. Sci. 388(1-3): 181-198 (2007)
- [c33]
- [c32]
- [c31]Krishnendu Chatterjee, Thomas A. Henzinger, Nir Piterman: Generalized Parity Games. FoSSaCS 2007: 153-167
- [c30]
- [c29]Krishnendu Chatterjee: Markov Decision Processes with Multiple Long-Run Average Objectives. FSTTCS 2007: 473-484
- [c28]Krishnendu Chatterjee, Thomas A. Henzinger: Probabilistic Systems with LimSup and LimInf Objectives. ILC 2007: 32-45
- [c27]Luca de Alfaro, Krishnendu Chatterjee, Marco Faella, Axel Legay: Qualitative Logics and Equivalences for Probabilistic Systems. QEST 2007: 237-248
- [c26]
- [i1]Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger, Jean-François Raskin: Algorithms for Omega-Regular Games with Imperfect Information. CoRR abs/0706.2619 (2007)
- 2006
- [j4]Krishnendu Chatterjee, Thomas A. Henzinger, Marcin Jurdzinski: Games with secure equilibria. Theor. Comput. Sci. 365(1-2): 67-82 (2006)
- [c25]Krishnendu Chatterjee, Thomas A. Henzinger: Strategy Improvement for Stochastic Rabin and Streett Games. CONCUR 2006: 375-389
- [c24]
- [c23]
- [c22]
- [c21]Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger, Jean-François Raskin: Algorithms for Omega-Regular Games with Imperfect Information, . CSL 2006: 287-302
- [c20]Krishnendu Chatterjee, Luca de Alfaro, Marco Faella, Thomas A. Henzinger, Rupak Majumdar, Mariëlle Stoelinga: Compositional Quantitative Reasoning. QEST 2006: 179-188
- [c19]Krishnendu Chatterjee, Luca de Alfaro, Thomas A. Henzinger: Strategy Improvement for Concurrent Reachability Games. QEST 2006: 291-300
- [c18]Krishnendu Chatterjee, Luca de Alfaro, Thomas A. Henzinger: The complexity of quantitative concurrent parity games. SODA 2006: 678-687
- [c17]Krishnendu Chatterjee, Rupak Majumdar, Thomas A. Henzinger: Markov Decision Processes with Multiple Objectives. STACS 2006: 325-336
- [c16]Krishnendu Chatterjee, Thomas A. Henzinger: Strategy Improvement and Randomized Subexponential Algorithms for Stochastic Parity Games. STACS 2006: 512-523
- [c15]Krishnendu Chatterjee, Thomas A. Henzinger: Finitary Winning in omega-Regular Games. TACAS 2006: 257-271
- 2005
- [c14]Arindam Chakrabarti, Krishnendu Chatterjee, Thomas A. Henzinger, Orna Kupferman, Rupak Majumdar: Verifying Quantitative Properties Using Bound Functions. CHARME 2005: 50-64
- [c13]
- [c12]
- [c11]Krishnendu Chatterjee, Luca de Alfaro, Thomas A. Henzinger: The Complexity of Stochastic Rabin and Streett Games'. ICALP 2005: 878-890
- [c10]Krishnendu Chatterjee, Thomas A. Henzinger, Marcin Jurdzinski: Mean-Payoff Parity Games. LICS 2005: 178-187
- [c9]Krishnendu Chatterjee, Thomas A. Henzinger, Ranjit Jhala, Rupak Majumdar: Counterexample-guided Planning. UAI 2005: 104-111
- 2004
- [j3]Krishnendu Chatterjee, Di Ma, Rupak Majumdar, Tian Zhao, Thomas A. Henzinger, Jens Palsberg: Stack size analysis for interrupt-driven programs. Inf. Comput. 194(2): 144-174 (2004)
- [j2]Krishnendu Chatterjee, Pallab Dasgupta, P. P. Chakrabarti: The power of first-order quantification over states in branching and linear time temporal logics. Inf. Process. Lett. 91(5): 201-210 (2004)
- [c8]Krishnendu Chatterjee, Rupak Majumdar, Marcin Jurdzinski: On Nash Equilibria in Stochastic Games. CSL 2004: 26-40
- [c7]Krishnendu Chatterjee, Thomas A. Henzinger, Marcin Jurdzinski: Games with Secure Equilibria. FMCO 2004: 141-161
- [c6]Krishnendu Chatterjee, Pallab Dasgupta, P. P. Chakrabarti: Complexity of Compositional Model Checking of Computation Tree Logic on Simple Structures. IWDC 2004: 102-113
- [c5]Krishnendu Chatterjee, Thomas A. Henzinger, Marcin Jurdzinski: Games with Secure Equilibria. LICS 2004: 160-169
- [c4]Krishnendu Chatterjee, Luca de Alfaro, Thomas A. Henzinger: Trading Memory for Randomness. QEST 2004: 206-217
- [c3]Krishnendu Chatterjee, Marcin Jurdzinski, Thomas A. Henzinger: Quantitative stochastic parity games. SODA 2004: 121-130
- 2003
- [j1]Krishnendu Chatterjee, Pallab Dasgupta, P. P. Chakrabarti: A Branching Time Temporal Framework for Quantitative Reasoning. J. Autom. Reasoning 30(2): 205-232 (2003)
- [c2]Krishnendu Chatterjee, Marcin Jurdzinski, Thomas A. Henzinger: Simple Stochastic Parity Games. CSL 2003: 100-113
- [c1]Krishnendu Chatterjee, Di Ma, Rupak Majumdar, Tian Zhao, Thomas A. Henzinger, Jens Palsberg: Stack Size Analysis for Interrupt-Driven Programs. SAS 2003: 109-126
Coauthor Index
[j23] [j20] [c94] [i51] [i44] [i43] [i42] [j17] [j16] [c84] [c82] [c77] [c75] [c71] [c69] [i35] [i30] [j14] [j13] [j12] [j11] [c67] [c66] [c65] [c64] [c63] [c60] [c57] [c56] [e1] [i23] [i21] [i20] [i18] [i17] [i16] [j9] [c54] [c53] [c52] [c51] [c50] [c49] [c48] [c47] [i15] [i14] [i13] [i12] [i11] [j8] [j7] [c44] [c43] [c42] [c41] [c40] [c39] [c37] [c36] [c35] [i9] [i7] [i6] [i5] [i4] [i3] [i2] [j6] [c33] [c31] [c28] [c26] [i1] [j4] [c25] [c21] [c20] [c19] [c18] [c17] [c16] [c15] [c14] [c12] [c11] [c10] [c9] [j3] [c7] [c5] [c4] [c3] [c2] [c1]
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-03 20:12 CEST by the dblp team