default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKrishnendu Chatterjee
Person information
- affiliation: IST Austria, Klosterneuburg, Austria
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j97]Yichao Zhang
, Jiasheng Wang, Guanghui Wen, Jihong Guan, Shuigeng Zhou, Guanrong Chen, Krishnendu Chatterjee, Matjaz Perc:
Limitation of Time Promotes Cooperation in Structured Collaboration Systems. IEEE Trans. Netw. Sci. Eng. 12(1): 4-12 (2025)- 2024
- [j96]Krishnendu Chatterjee, Joost-Pieter Katoen, Stefanie Mohr, Maximilian Weininger, Tobias Winkler:
Stochastic games with lexicographic objectives. Formal Methods Syst. Des. 63(1): 40-80 (2024) - [j95]Christel Baier, Krishnendu Chatterjee, Tobias Meggendorfer, Jakob Piribauer:
Entropic risk for turn-based stochastic games. Inf. Comput. 301: 105214 (2024) - [j94]Krishnendu Chatterjee, Laurent Doyen:
Stochastic Processes with Expected Stopping Time. Log. Methods Comput. Sci. 20(4) (2024) - [j93]Krishnendu Chatterjee, Amir Kafshdar Goharshady, Tobias Meggendorfer, Dorde Zikelic:
Quantitative Bounds on Resource Usage of Probabilistic Programs. Proc. ACM Program. Lang. 8(OOPSLA1): 362-391 (2024) - [j92]Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Petr Novotný, Dorde Zikelic:
Equivalence and Similarity Refutation for Probabilistic Programs. Proc. ACM Program. Lang. 8(PLDI): 2098-2122 (2024) - [j91]Jakub Svoboda, Soham Joshi, Josef Tkadlec, Krishnendu Chatterjee:
Amplifiers of selection for the Moran process with both Birth-death and death-Birth updating. PLoS Comput. Biol. 20(3): 1012008 (2024) - [c246]Krishnendu Chatterjee, Amir Kafshdar Goharshady, Ehsan Kafshdar Goharshady, Mehrdad Karrabi, Dorde Zikelic:
Sound and Complete Witnesses for Template-Based Verification of LTL Properties on Polynomial Programs. FM (1) 2024: 600-619 - [c245]Ali Asadi, Krishnendu Chatterjee, Raimundo Saona, Jakub Svoboda:
Concurrent Stochastic Games with Stateful-Discounted and Parity Objectives: Complexity and Algorithms. FSTTCS 2024: 5:1-5:17 - [c244]Jakub Svoboda, Suguman Bansal, Krishnendu Chatterjee:
Reinforcement Learning from Reachability Specifications: PAC Guarantees with Expected Conditional Distance. ICML 2024 - [c243]S. Akshay, Krishnendu Chatterjee, Tobias Meggendorfer, Dorde Zikelic:
Certified Policy Verification and Synthesis for MDPs under Distributional Reach-Avoidance Properties. IJCAI 2024: 3-12 - [c242]Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Mehrdad Karrabi, Petr Novotný, Dorde Zikelic:
Solving Long-run Average Reward Robust MDPs via Stochastic Games. IJCAI 2024: 6707-6715 - [c241]Ali Asadi, Krishnendu Chatterjee, Jakub Svoboda, Raimundo Saona Urmeneta:
Deterministic Sub-exponential Algorithm for Discounted-sum Games with Unary Weights. LICS 2024: 6:1-6:12 - [c240]Esra Ceylan, Krishnendu Chatterjee, Stefan Schmid, Jakub Svoboda:
Congestion-Free Rerouting of Network Flows: Hardness and an FPT Algorithm. NOMS 2024: 1-7 - [c239]Dan Alistarh, Krishnendu Chatterjee, Mehrdad Karrabi, John Lazarsfeld:
Game Dynamics and Equilibrium Computation in the Population Protocol Model. PODC 2024: 40-49 - [c238]Krishnendu Chatterjee, Amirali Ebrahim-Zadeh, Mehrdad Karrabi, Krzysztof Pietrzak, Michelle Yeo, Dorde Zikelic:
Fully Automated Selfish Mining Analysis in Efficient Proof Systems Blockchains. PODC 2024: 268-278 - [i190]Krishnendu Chatterjee, Amir Kafshdar Goharshady, Ehsan Kafshdar Goharshady, Mehrdad Karrabi, Dorde Zikelic:
Sound and Complete Witnesses for Template-based Verification of LTL Properties on Polynomial Programs. CoRR abs/2403.05386 (2024) - [i189]Tomás Brázdil, Krishnendu Chatterjee, Martin Chmelik, Vojtech Forejt, Jan Kretínský, Marta Kwiatkowska, Tobias Meggendorfer, David Parker, Mateusz Ujma:
Learning Algorithms for Verification of Markov Decision Processes. CoRR abs/2403.09184 (2024) - [i188]Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Petr Novotný, Dorde Zikelic:
Equivalence and Similarity Refutation for Probabilistic Programs. CoRR abs/2404.03430 (2024) - [i187]Ali Asadi, Krishnendu Chatterjee, Raimundo Saona, Jakub Svoboda:
Deterministic Sub-exponential Algorithm for Discounted-sum Games with Unary Weights. CoRR abs/2405.02479 (2024) - [i186]Ali Asadi, Krishnendu Chatterjee, Raimundo Saona, Jakub Svoboda:
Concurrent Stochastic Games with Stateful-discounted and Parity Objectives: Complexity and Algorithms. CoRR abs/2405.02486 (2024) - [i185]S. Akshay, Krishnendu Chatterjee, Tobias Meggendorfer, Dorde Zikelic:
Certified Policy Verification and Synthesis for MDPs under Distributional Reach-avoidance Properties. CoRR abs/2405.04015 (2024) - [i184]Krishnendu Chatterjee, Amirali Ebrahim-Zadeh, Mehrdad Karrabi, Krzysztof Pietrzak, Michelle Yeo, Dorde Zikelic:
Fully Automated Selfish Mining Analysis in Efficient Proof Systems Blockchains. CoRR abs/2405.04420 (2024) - [i183]Krishnendu Chatterjee, David Lurie, Raimundo Saona, Bruno Ziliotto:
Ergodic Unobservable MDPs: Decidability of Approximation. CoRR abs/2405.12583 (2024) - [i182]Krishnendu Chatterjee, Amir Kafshdar Goharshady, Ehsan Kafshdar Goharshady, Mehrdad Karrabi, Milad Saadat, Dorde Zikelic:
PolyHorn: A Polynomial Horn Clause Solver. CoRR abs/2408.03796 (2024) - [i181]Ali Asadi, Krishnendu Chatterjee, Raimundo Saona, Ali Shafiee:
Limit-sure reachability for small memory policies in POMDPs is NP-complete. CoRR abs/2412.00941 (2024) - [i180]Krishnendu Chatterjee, Ruichen Luo, Raimundo Saona, Jakub Svoboda:
Linear Equations with Min and Max Operators: Computational Complexity. CoRR abs/2412.12228 (2024) - [i179]Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Mehrdad Karrabi, Harshit J. Motwani, Maximilian Seeliger, Dorde Zikelic:
Quantified Linear and Polynomial Arithmetic Satisfiability via Template-based Skolemization. CoRR abs/2412.16226 (2024) - [i178]Krishnendu Chatterjee, Amirali Ebrahim-Zadeh, Mehrdad Karrabi, Krzysztof Pietrzak, Michelle Yeo, Dorde Zikelic:
Fully Automated Selfish Mining Analysis in Efficient Proof Systems Blockchains. IACR Cryptol. ePrint Arch. 2024: 704 (2024) - 2023
- [j90]Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Petr Novotný, Jiri Zárevúcky, Dorde Zikelic:
On Lexicographic Proof Rules for Probabilistic Termination. Formal Aspects Comput. 35(2): 11:1-11:25 (2023) - [c237]Dorde Zikelic, Mathias Lechner, Thomas A. Henzinger, Krishnendu Chatterjee:
Learning Control Policies for Stochastic Systems with Reach-Avoid Guarantees. AAAI 2023: 11926-11935 - [c236]Mathias Lechner, Dorde Zikelic, Krishnendu Chatterjee, Thomas A. Henzinger, Daniela Rus:
Quantization-Aware Interval Bound Propagation for Training Certifiably Robust Quantized Neural Networks. AAAI 2023: 14964-14973 - [c235]Matin Ansaripour, Krishnendu Chatterjee, Thomas A. Henzinger, Mathias Lechner, Dorde Zikelic:
Learning Provably Stabilizing Neural Controllers for Discrete-Time Stochastic Systems. ATVA (1) 2023: 357-379 - [c234]Yican Sun, Hongfei Fu, Krishnendu Chatterjee, Amir Kafshdar Goharshady:
Automated Tail Bound Analysis for Probabilistic Recurrence Relations. CAV (3) 2023: 16-39 - [c233]S. Akshay, Krishnendu Chatterjee, Tobias Meggendorfer, Dorde Zikelic:
MDPs as Distribution Transformers: Affine Invariant Synthesis for Safety Objectives. CAV (3) 2023: 86-112 - [c232]Mahsa Bastankhah, Krishnendu Chatterjee, Mohammad Ali Maddah-Ali, Stefan Schmid, Jakub Svoboda, Michelle Yeo:
R2: Boosting Liquidity in Payment Channel Networks with Online Admission Control. FC (1) 2023: 309-325 - [c231]Christel Baier, Krishnendu Chatterjee, Tobias Meggendorfer, Jakob Piribauer:
Entropic Risk for Turn-Based Stochastic Games. MFCS 2023: 15:1-15:16 - [c230]Dorde Zikelic, Mathias Lechner, Abhinav Verma, Krishnendu Chatterjee, Thomas A. Henzinger:
Compositional Policy Learning in Stochastic Control Systems with Formal Guarantees. NeurIPS 2023 - [c229]Juho Hirvonen, Laura Schmid, Krishnendu Chatterjee, Stefan Schmid:
On the Convergence Time in Graphical Games: A Locality-Sensitive Approach. OPODIS 2023: 11:1-11:24 - [c228]Krishnendu Chatterjee, Tobias Meggendorfer, Raimundo Saona, Jakub Svoboda:
Faster Algorithm for Turn-based Stochastic Games with Bounded Treewidth. SODA 2023: 4590-4605 - [c227]Krishnendu Chatterjee, Thomas A. Henzinger, Mathias Lechner, Dorde Zikelic:
A Learner-Verifier Framework for Neural Network Controllers and Certificates of Stochastic Systems. TACAS (1) 2023: 3-25 - [i177]Yican Sun, Hongfei Fu, Krishnendu Chatterjee, Amir Kafshdar Goharshady:
Automated Tail Bound Analysis for Probabilistic Recurrence Relations. CoRR abs/2305.15104 (2023) - [i176]S. Akshay, Krishnendu Chatterjee, Tobias Meggendorfer, Dorde Zikelic:
MDPs as Distribution Transformers: Affine Invariant Synthesis for Safety Objectives. CoRR abs/2305.16796 (2023) - [i175]Christel Baier, Krishnendu Chatterjee, Tobias Meggendorfer, Jakob Piribauer:
Entropic Risk for Turn-Based Stochastic Games. CoRR abs/2307.06611 (2023) - [i174]Dan Alistarh, Krishnendu Chatterjee, Mehrdad Karrabi, John Lazarsfeld:
Repeated Game Dynamics in Population Protocols. CoRR abs/2307.07297 (2023) - [i173]Dorde Zikelic, Mathias Lechner, Abhinav Verma, Krishnendu Chatterjee, Thomas A. Henzinger:
Compositional Policy Learning in Stochastic Control Systems with Formal Guarantees. CoRR abs/2312.01456 (2023) - [i172]Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Mehrdad Karrabi, Petr Novotný, Dorde Zikelic:
Solving Long-run Average Reward Robust MDPs via Stochastic Games. CoRR abs/2312.13912 (2023) - 2022
- [j89]Krishnendu Chatterjee, Laurent Doyen:
Graph planning with expected finite horizon. J. Comput. Syst. Sci. 129: 1-21 (2022) - [j88]Krishnendu Chatterjee, Raimundo Saona, Bruno Ziliotto:
Finite-Memory Strategies in POMDPs with Long-Run Average Objectives. Math. Oper. Res. 47(1): 100-119 (2022) - [j87]Laura Schmid, Christian Hilbe, Krishnendu Chatterjee, Martin A. Nowak:
Direct reciprocity between individuals that use different strategy spaces. PLoS Comput. Biol. 18(6) (2022) - [c226]Mathias Lechner, Dorde Zikelic, Krishnendu Chatterjee, Thomas A. Henzinger:
Stability Verification in Stochastic Control Systems via Neural Network Supermartingales. AAAI 2022: 7326-7336 - [c225]Krishnendu Chatterjee, Amir Kafshdar Goharshady, Tobias Meggendorfer, Dorde Zikelic:
Sound and Complete Certificates for Quantitative Termination Analysis of Probabilistic Programs. CAV (1) 2022: 55-78 - [c224]Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Ismaël Jecker, Jakub Svoboda:
Complexity of Spatial Games. FSTTCS 2022: 11:1-11:14 - [c223]Ali Ahmadi, Krishnendu Chatterjee, Amir Kafshdar Goharshady, Tobias Meggendorfer, Roodabeh Safavi, Dorde Zikelic:
Algorithms and Hardness Results for Computing Cores of Markov Chains. FSTTCS 2022: 29:1-29:20 - [e4]Jean-François Raskin, Krishnendu Chatterjee, Laurent Doyen, Rupak Majumdar:
Principles of Systems Design - Essays Dedicated to Thomas A. Henzinger on the Occasion of His 60th Birthday. Lecture Notes in Computer Science 13660, Springer 2022, ISBN 978-3-031-22336-5 [contents] - [i171]Dorde Zikelic, Mathias Lechner, Krishnendu Chatterjee, Thomas A. Henzinger:
Learning Stabilizing Policies in Stochastic Control Systems. CoRR abs/2205.11991 (2022) - [i170]Mahsa Bastankhah, Krishnendu Chatterjee, Mohammad Ali Maddah-Ali, Stefan Schmid, Jakub Svoboda, Michelle Yeo:
Online Admission Control and Rebalancing in Payment Channel Networks. CoRR abs/2209.11936 (2022) - [i169]Krishnendu Chatterjee, Mona Mohammadi, Raimundo Saona:
Repeated Prophet Inequality with Near-optimal Bounds. CoRR abs/2209.14368 (2022) - [i168]Krishnendu Chatterjee, Jakub Svoboda, Dorde Zikelic, Andreas Pavlogiannis, Josef Tkadlec:
Social Balance on Networks: Local Minima and Best Edge Dynamics. CoRR abs/2210.02394 (2022) - [i167]Matin Ansaripour, Mathias Lechner, Dorde Zikelic, Krishnendu Chatterjee, Thomas A. Henzinger:
Learning Control Policies for Region Stabilization in Stochastic Systems. CoRR abs/2210.05304 (2022) - [i166]Dorde Zikelic, Mathias Lechner, Thomas A. Henzinger, Krishnendu Chatterjee:
Learning Control Policies for Stochastic Systems with Reach-avoid Guarantees. CoRR abs/2210.05308 (2022) - [i165]Mathias Lechner, Dorde Zikelic, Krishnendu Chatterjee, Thomas A. Henzinger, Daniela Rus:
Quantization-aware Interval Bound Propagation for Training Certifiably Robust Quantized Neural Networks. CoRR abs/2211.16187 (2022) - 2021
- [j86]Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Alexander Svozil:
Algorithms and conditional lower bounds for planning problems. Artif. Intell. 297: 103499 (2021) - [j85]Martin Zeiner, Ulrich Schmid, Krishnendu Chatterjee:
Optimal strategies for selecting coordinators. Discret. Appl. Math. 289: 392-415 (2021) - [j84]Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Andreas Pavlogiannis:
Faster algorithms for quantitative verification in bounded treewidth graphs. Formal Methods Syst. Des. 57(3): 401-428 (2021) - [j83]Truc Lam Bui, Krishnendu Chatterjee, Tushar Gautam, Andreas Pavlogiannis, Viktor Toman:
The reads-from equivalence for the TSO and PSO memory models. Proc. ACM Program. Lang. 5(OOPSLA): 1-30 (2021) - [j82]Maria Kleshnina, Sabrina S. Streipert, Jerzy A. Filar, Krishnendu Chatterjee:
Mistakes can stabilise the dynamics of rock-paper-scissors games. PLoS Comput. Biol. 17(4) (2021) - [c222]Pratyush Agarwal, Krishnendu Chatterjee, Shreya Pathak, Andreas Pavlogiannis, Viktor Toman:
Stateless Model Checking Under a Reads-Value-From Equivalence. CAV (1) 2021: 341-366 - [c221]Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Petr Novotný, Jiri Zárevúcky, Dorde Zikelic:
On Lexicographic Proof Rules for Probabilistic Termination. FM 2021: 619-639 - [c220]Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Andreas Pavlogiannis:
Quantitative Verification on Product Graphs of Small Treewidth. FSTTCS 2021: 42:1-42:23 - [c219]Krishnendu Chatterjee, Monika Henzinger, Sagar Kale, Alexander Svozil:
Faster Algorithms for Bounded Liveness in Graphs and Game Graphs. ICALP 2021: 124:1-124:21 - [c218]Petr Tomásek, Karel Horák, Aditya Aradhye, Branislav Bosanský, Krishnendu Chatterjee:
Solving Partially Observable Stochastic Shortest-Path Games. IJCAI 2021: 4182-4189 - [c217]Krishnendu Chatterjee, Laurent Doyen:
Stochastic Processes with Expected Stopping Time. LICS 2021: 1-13 - [c216]Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Alexander Svozil:
Symbolic Time and Space Tradeoffs for Probabilistic Verification. LICS 2021: 1-13 - [c215]Mathias Lechner, Dorde Zikelic, Krishnendu Chatterjee, Thomas A. Henzinger:
Infinite Time Horizon Safety of Bayesian Neural Networks. NeurIPS 2021: 10171-10185 - [c214]Ali Asadi, Krishnendu Chatterjee, Hongfei Fu, Amir Kafshdar Goharshady, Mohammad Mahdavi:
Polynomial reachability witnesses via Stellensätze. PLDI 2021: 772-787 - [c213]Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Petr Novotný, Dorde Zikelic:
Proving non-termination by program reversal. PLDI 2021: 1033-1048 - [c212]Jinyi Wang, Yican Sun, Hongfei Fu, Krishnendu Chatterjee, Amir Kafshdar Goharshady:
Quantitative analysis of assertion violations in probabilistic programs. PLDI 2021: 1171-1186 - [c211]Suguman Bansal, Krishnendu Chatterjee, Moshe Y. Vardi:
On Satisficing in Quantitative Games. TACAS (1) 2021: 20-37 - [i164]Suguman Bansal, Krishnendu Chatterjee, Moshe Y. Vardi:
On Satisficing in Quantitative Games. CoRR abs/2101.02594 (2021) - [i163]Juho Hirvonen, Laura Schmid, Krishnendu Chatterjee, Stefan Schmid:
Classifying Convergence Complexity of Nash Equilibria in Graphical Games Using Distributed Computing Theory. CoRR abs/2102.13457 (2021) - [i162]Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Petr Novotný, Dorde Zikelic:
Proving Non-termination by Program Reversal. CoRR abs/2104.01189 (2021) - [i161]Krishnendu Chatterjee, Laurent Doyen:
Stochastic Processes with Expected Stopping Time. CoRR abs/2104.07278 (2021) - [i160]Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Alexander Svozil:
Symbolic Time and Space Tradeoffs for Probabilistic Verification. CoRR abs/2104.07466 (2021) - [i159]Pratyush Agarwal, Krishnendu Chatterjee, Shreya Pathak, Andreas Pavlogiannis, Viktor Toman:
Stateless Model Checking under a Reads-Value-From Equivalence. CoRR abs/2105.06424 (2021) - [i158]Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Petr Novotný, Jiri Zárevúcky, Dorde Zikelic:
On Lexicographic Proof Rules for Probabilistic Termination. CoRR abs/2108.02188 (2021) - [i157]Mathias Lechner, Dorde Zikelic, Krishnendu Chatterjee, Thomas A. Henzinger:
Infinite Time Horizon Safety of Bayesian Neural Networks. CoRR abs/2111.03165 (2021) - [i156]Mathias Lechner, Dorde Zikelic, Krishnendu Chatterjee, Thomas A. Henzinger:
Stability Verification in Stochastic Control Systems via Neural Network Supermartingales. CoRR abs/2112.09495 (2021) - 2020
- [j81]Peixin Wang, Hongfei Fu, Krishnendu Chatterjee, Yuxin Deng, Ming Xu:
Proving expected sensitivity of probabilistic programs with randomized variable-dependent termination time. Proc. ACM Program. Lang. 4(POPL): 25:1-25:30 (2020) - [j80]Josef Tkadlec, Andreas Pavlogiannis, Krishnendu Chatterjee, Martin A. Nowak:
Limits on amplifiers of natural selection under death-Birth updating. PLoS Comput. Biol. 16(1) (2020) - [j79]Kamran Kaveh, Alex McAvoy, Krishnendu Chatterjee, Martin A. Nowak:
The Moran process on 2-chromatic graphs. PLoS Comput. Biol. 16(11): 1008402 (2020) - [j78]Andreas Pavlogiannis, Nico Schaumberger, Ulrich Schmid, Krishnendu Chatterjee:
Precedence-Aware Automated Competitive Analysis of Real-Time Scheduling. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 39(11): 3981-3992 (2020) - [c210]Tomás Brázdil, Krishnendu Chatterjee, Petr Novotný, Jiri Vahala:
Reinforcement Learning of Risk-Constrained Policies in Markov Decision Processes. AAAI 2020: 9794-9801 - [c209]Krishnendu Chatterjee, Martin Chmelík, Deep Karkhanis, Petr Novotný, Amélie Royer:
Multiple-Environment Markov Decision Processes: Efficient Analysis and Applications. ICAPS 2020: 48-56 - [c208]Ali Asadi, Krishnendu Chatterjee, Amir Kafshdar Goharshady, Kiarash Mohammadi, Andreas Pavlogiannis:
Faster Algorithms for Quantitative Analysis of MCs and MDPs with Small Treewidth. ATVA 2020: 253-270 - [c207]Krishnendu Chatterjee, Joost-Pieter Katoen, Maximilian Weininger, Tobias Winkler:
Stochastic Games with Lexicographic Reachability-Safety Objectives. CAV (2) 2020: 398-420 - [c206]Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop:
Multi-Dimensional Long-Run Average Problems for Vector Addition Systems with States. CONCUR 2020: 23:1-23:22 - [c205]Krishnendu Chatterjee, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, Andreas Pavlogiannis:
Optimal and Perfectly Parallel Algorithms for On-demand Data-Flow Analysis. ESOP 2020: 112-140 - [c204]Pranav Ashok, Krishnendu Chatterjee, Jan Kretínský, Maximilian Weininger, Tobias Winkler:
Approximating Values of Generalized-Reachability Stochastic Games. LICS 2020: 102-115 - [c203]Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Ismaël Jecker, Jakub Svoboda:
Simplified Game of Life: Algorithms and Complexity. MFCS 2020: 22:1-22:13 - [c202]Krishnendu Chatterjee, Hongfei Fu, Amir Kafshdar Goharshady, Ehsan Kafshdar Goharshady:
Polynomial invariant generation for non-deterministic recursive programs. PLDI 2020: 672-687 - [i155]Krishnendu Chatterjee, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, Andreas Pavlogiannis:
Optimal and Perfectly Parallel Algorithms for On-demand Data-flow Analysis. CoRR abs/2001.11070 (2020) - [i154]Tomás Brázdil, Krishnendu Chatterjee, Petr Novotný, Jiri Vahala:
Reinforcement Learning of Risk-Constrained Policies in Markov Decision Processes. CoRR abs/2002.12086 (2020) - [i153]Ali Asadi, Krishnendu Chatterjee, Amir Kafshdar Goharshady, Kiarash Mohammadi, Andreas Pavlogiannis:
Faster Algorithms for Quantitative Analysis of Markov Chains and Markov Decision Processes with Small Treewidth. CoRR abs/2004.08828 (2020) - [i152]Krishnendu Chatterjee, Joost-Pieter Katoen, Maximilian Weininger, Tobias Winkler:
Stochastic Games with Lexicographic Reachability-Safety Objectives. CoRR abs/2005.04018 (2020) - [i151]Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop:
Multi-dimensional Long-Run Average Problems for Vector Addition Systems with States. CoRR abs/2007.08917 (2020) - [i150]Ali Asadi, Krishnendu Chatterjee, Hongfei Fu, Amir Kafshdar Goharshady, Mohammad Mahdavi:
Inductive Reachability Witnesses. CoRR abs/2007.14259 (2020) - [i149]Jinyi Wang, Yican Sun, Hongfei Fu, Mingzhang Huang, Amir Kafshdar Goharshady, Krishnendu Chatterjee:
Concentration-Bound Analysis for Probabilistic Programs and Probabilistic Recurrence Relations. CoRR abs/2008.00425 (2020) - [i148]Truc Lam Bui, Krishnendu Chatterjee, Tushar Gautam, Andreas Pavlogiannis, Viktor Toman:
The Reads-From Equivalence for the TSO and PSO Memory Models. CoRR abs/2011.11763 (2020) - [i147]Jinyi Wang, Yican Sun, Hongfei Fu, Amir Kafshdar Goharshady, Krishnendu Chatterjee:
Quantitative Analysis of Assertion Violations in Probabilistic Programs. CoRR abs/2011.14617 (2020)
2010 – 2019
- 2019
- [j77]Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop:
Quantitative Automata under Probabilistic Semantics. Log. Methods Comput. Sci. 15(3) (2019) - [j76]Krishnendu Chatterjee, Andreas Pavlogiannis, Viktor Toman:
Value-centric dynamic partial order reduction. Proc. ACM Program. Lang. 3(OOPSLA): 124:1-124:29 (2019) - [j75]Mingzhang Huang, Hongfei Fu, Krishnendu Chatterjee, Amir Kafshdar Goharshady:
Modular verification for almost-sure termination of probabilistic programs. Proc. ACM Program. Lang. 3(OOPSLA): 129:1-129:29 (2019) - [j74]Krishnendu Chatterjee, Amir Kafshdar Goharshady, Nastaran Okati, Andreas Pavlogiannis:
Efficient parameterized algorithms for data packing. Proc. ACM Program. Lang. 3(POPL): 53:1-53:28 (2019) - [j73]Krishnendu Chatterjee, Hongfei Fu, Amir Kafshdar Goharshady:
Non-polynomial Worst-Case Analysis of Recursive Programs. ACM Trans. Program. Lang. Syst. 41(4): 20:1-20:52 (2019) - [j72]Krishnendu Chatterjee, Amir Kafshdar Goharshady, Prateesh Goyal, Rasmus Ibsen-Jensen, Andreas Pavlogiannis:
Faster Algorithms for Dynamic Algebraic Queries in Basic RSMs with Constant Treewidth. ACM Trans. Program. Lang. Syst. 41(4): 23:1-23:46 (2019) - [c201]Tomás Brázdil, Krishnendu Chatterjee, Antonín Kucera, Petr Novotný, Dominik Velan:
Deciding Fast Termination for Probabilistic VASS with Nondeterminism. ATVA 2019: 462-478 - [c200]Guy Avni, Roderick Bloem, Krishnendu Chatterjee, Thomas A. Henzinger, Bettina Könighofer, Stefan Pranger:
Run-Time Optimization for Learned Controllers Through Quantitative Games. CAV (1) 2019: 630-649 - [c199]Krishnendu Chatterjee, Nir Piterman:
Combinations of Qualitative Winning for Stochastic Parity Games. CONCUR 2019: 6:1-6:17 - [c198]Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Alexander Svozil:
Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPs. CONCUR 2019: 7:1-7:16 - [c197]Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop:
Long-Run Average Behavior of Vector Addition Systems with States. CONCUR 2019: 27:1-27:16 - [c196]Krishnendu Chatterjee, Amir Kafshdar Goharshady, Arash Pourdamghani:
Probabilistic Smart Contracts: Secure Randomness on the Blockchain. IEEE ICBC 2019: 403-412 - [c195]Krishnendu Chatterjee, Laurent Doyen:
Graph Planning with Expected Finite Horizon. LICS 2019: 1-13 - [c194]Laura Schmid, Krishnendu Chatterjee, Stefan Schmid:
The Evolutionary Price of Anarchy: Locally Bounded Agents in a Dynamic Virus Game. OPODIS 2019: 21:1-21:16 - [c193]Peixin Wang, Hongfei Fu, Amir Kafshdar Goharshady, Krishnendu Chatterjee, Xudong Qin, Wenjun Shi:
Cost analysis of nondeterministic probabilistic programs. PLDI 2019: 204-220 - [c192]Pranav Ashok, Tomás Brázdil, Krishnendu Chatterjee, Jan Kretínský, Christoph H. Lampert, Viktor Toman:
Strategy Representation by Decision Trees with Linear Classifiers. QEST 2019: 109-128 - [c191]Krishnendu Chatterjee, Amir Kafshdar Goharshady, Arash Pourdamghani:
Hybrid mining: exploiting blockchain's computational power for distributed problem solving. SAC 2019: 374-381 - [c190]Krishnendu Chatterjee, Amir Kafshdar Goharshady, Ehsan Kafshdar Goharshady:
The treewidth of smart contracts. SAC 2019: 400-408 - [c189]Hongfei Fu, Krishnendu Chatterjee:
Termination of Nondeterministic Probabilistic Programs. VMCAI 2019: 468-490 - [i146]Mingzhang Huang, Hongfei Fu, Krishnendu Chatterjee, Amir Kafshdar Goharshady:
Compositional Analysis for Almost-Sure Termination of Probabilistic Programs. CoRR abs/1901.06087 (2019) - [i145]Krishnendu Chatterjee, Hongfei Fu, Amir Kafshdar Goharshady, Ehsan Kafshdar Goharshady:
Polynomial Invariant Generation for Non-deterministic Recursive Programs. CoRR abs/1902.04373 (2019) - [i144]Krishnendu Chatterjee, Hongfei Fu, Amir Kafshdar Goharshady, Peixin Wang, Xudong Qin, Wenjun Shi:
Cost Analysis of Nondeterministic Probabilistic Programs. CoRR abs/1902.04659 (2019) - [i143]Peixin Wang, Hongfei Fu, Krishnendu Chatterjee, Kangli He, Ming Xu:
Proving Expected Sensitivity of Probabilistic Programs with Randomized Execution Time. CoRR abs/1902.04744 (2019) - [i142]Krishnendu Chatterjee, Amir Kafshdar Goharshady, Arash Pourdamghani:
Probabilistic Smart Contracts: Secure Randomness on the Blockchain. CoRR abs/1902.07986 (2019) - [i141]Krishnendu Chatterjee, Raimundo Saona, Bruno Ziliotto:
The Complexity of POMDPs with Long-run Average Objectives. CoRR abs/1904.13360 (2019) - [i140]Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop:
Long-Run Average Behavior of Vector Addition Systems with States. CoRR abs/1905.05537 (2019) - [i139]Krishnendu Chatterjee, Laura Schmid, Stefan Schmid:
The Evolutionary Price of Anarchy: Locally Bounded Agents in a Dynamic Virus Game. CoRR abs/1906.00110 (2019) - [i138]Pranav Ashok, Tomás Brázdil, Krishnendu Chatterjee, Jan Kretínský, Christoph H. Lampert, Viktor Toman:
Strategy Representation by Decision Trees with Linear Classifiers. CoRR abs/1906.08178 (2019) - [i137]Tomás Brázdil, Krishnendu Chatterjee, Antonín Kucera, Petr Novotný, Dominik Velan:
Deciding Fast Termination for Probabilistic VASS with Nondeterminism. CoRR abs/1907.11010 (2019) - [i136]Krishnendu Chatterjee, Andreas Pavlogiannis, Viktor Toman:
Value-centric Dynamic Partial Order Reduction. CoRR abs/1909.00989 (2019) - [i135]Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Alexander Svozil:
Quasipolynomial Set-Based Symbolic Algorithms for Parity Games. CoRR abs/1909.04983 (2019) - [i134]Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Alexander Svozil:
Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPs. CoRR abs/1909.05539 (2019) - [i133]Krishnendu Chatterjee, Bhavya Choudhary, Andreas Pavlogiannis:
Optimal Dyck Reachability for Data-Dependence and Alias Analysis. CoRR abs/1910.00241 (2019) - 2018
- [j71]Krishnendu Chatterjee, Bhavya Choudhary, Andreas Pavlogiannis:
Optimal Dyck reachability for data-dependence and alias analysis. Proc. ACM Program. Lang. 2(POPL): 30:1-30:30 (2018) - [j70]Marek Chalupa, Krishnendu Chatterjee, Andreas Pavlogiannis, Nishant Sinha, Kapil Vaidya:
Data-centric dynamic partial order reduction. Proc. ACM Program. Lang. 2(POPL): 31:1-31:30 (2018) - [j69]Sheshansh Agrawal, Krishnendu Chatterjee, Petr Novotný:
Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs. Proc. ACM Program. Lang. 2(POPL): 34:1-34:32 (2018) - [j68]Krishnendu Chatterjee, Andreas Pavlogiannis, Alexander Kößler, Ulrich Schmid:
Automated competitive analysis of real-time scheduling with graph games. Real Time Syst. 54(1): 166-207 (2018) - [j67]Krishnendu Chatterjee, Hongfei Fu, Petr Novotný, Rouzbeh Hasheminezhad:
Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs. ACM Trans. Program. Lang. Syst. 40(2): 7:1-7:45 (2018) - [j66]Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Amir Kafshdar Goharshady, Andreas Pavlogiannis:
Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components. ACM Trans. Program. Lang. Syst. 40(3): 9:1-9:43 (2018) - [c188]Krishnendu Chatterjee, Martin Chmelik, Ufuk Topcu:
Sensor Synthesis for POMDPs with Reachability Objectives. ICAPS 2018: 47-55 - [c187]Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Alexander Svozil:
Algorithms and Conditional Lower Bounds for Planning Problems. ICAPS 2018: 56-64 - [c186]Mingzhang Huang, Hongfei Fu, Krishnendu Chatterjee:
New Approaches for Almost-Sure Termination of Probabilistic Programs. APLAS 2018: 181-201 - [c185]Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop:
Computing Average Response Time. Principles of Modeling 2018: 143-161 - [c184]Krishnendu Chatterjee, Monika Henzinger, Veronika Loitzenbauer, Simin Oraee, Viktor Toman:
Symbolic Algorithms for Graphs and Markov Decision Processes with Fairness Objectives. CAV (2) 2018: 178-197 - [c183]Krishnendu Chatterjee, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, Yaron Velner:
Ergodic Mean-Payoff Games for the Analysis of Attacks in Crypto-Currencies. CONCUR 2018: 11:1-11:17 - [c182]Krishnendu Chatterjee, Amir Kafshdar Goharshady, Yaron Velner:
Quantitative Analysis of Smart Contracts. ESOP 2018: 739-767 - [c181]Krishnendu Chatterjee, Adrián Elgyütt, Petr Novotný, Owen Rouillé:
Expectation Optimization with Probabilistic Guarantees in POMDPs with Discounted-Sum Objectives. IJCAI 2018: 4692-4699 - [c180]Krishnendu Chatterjee, Hongfei Fu, Amir Kafshdar Goharshady, Nastaran Okati:
Computational Approaches for Stochastic Shortest Path on Succinct MDPs. IJCAI 2018: 4700-4707 - [c179]Karel Horák, Branislav Bosanský, Krishnendu Chatterjee:
Goal-HSVI: Heuristic Search Value Iteration for Goal POMDPs. IJCAI 2018: 4764-4770 - [c178]Amir Kafshdar Goharshady, Ali Behrouz, Krishnendu Chatterjee:
Secure Credit Reporting on the Blockchain. iThings/GreenCom/CPSCom/SmartData 2018: 1343-1348 - [c177]Tomás Brázdil, Krishnendu Chatterjee, Antonín Kucera, Petr Novotný, Dominik Velan, Florian Zuleger:
Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS. LICS 2018: 185-194 - [c176]Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Alexander Svozil:
Quasipolynomial Set-Based Symbolic Algorithms for Parity Games. LPAR 2018: 233-253 - [c175]Sebastian Arming, Ezio Bartocci, Krishnendu Chatterjee, Joost-Pieter Katoen, Ana Sokolova:
Parameter-Independent Strategies for pMDPs via POMDPs. QEST 2018: 53-70 - [c174]Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Veronika Loitzenbauer:
Lower Bounds for Symbolic Computation on Graphs: Strongly Connected Components, Liveness, Safety, and Diameter. SODA 2018: 2341-2356 - [c173]Tomás Brázdil, Krishnendu Chatterjee, Jan Kretínský, Viktor Toman:
Strategy Representation by Decision Trees in Reactive Synthesis. TACAS (1) 2018: 385-407 - [p1]Roderick Bloem, Krishnendu Chatterjee, Barbara Jobstmann:
Graph Games and Reactive Synthesis. Handbook of Model Checking 2018: 921-962 - [i132]Krishnendu Chatterjee, Amir Kafshdar Goharshady, Yaron Velner:
Quantitative Analysis of Smart Contracts. CoRR abs/1801.03367 (2018) - [i131]Tomás Brázdil, Krishnendu Chatterjee, Jan Kretínský, Viktor Toman:
Strategy Representation by Decision Trees in Reactive Synthesis. CoRR abs/1802.00758 (2018) - [i130]Andreas Pavlogiannis, Josef Tkadlec, Krishnendu Chatterjee, Martin A. Nowak:
Strong Amplifiers of Natural Selection: Proofs. CoRR abs/1802.02509 (2018) - [i129]Krishnendu Chatterjee, Laurent Doyen:
Graph Planning with Expected Finite Horizon. CoRR abs/1802.03642 (2018) - [i128]Krishnendu Chatterjee, Monika Henzinger, Veronika Loitzenbauer, Simin Oraee, Viktor Toman:
Symbolic Algorithms for Graphs and Markov Decision Processes with Fairness Objectives. CoRR abs/1804.00206 (2018) - [i127]Krishnendu Chatterjee, Nir Piterman:
Combinations of Qualitative Winning for Stochastic Parity Games. CoRR abs/1804.03453 (2018) - [i126]Krishnendu Chatterjee, Nir Piterman:
Coverability: Realizability Lower Bounds. CoRR abs/1804.03454 (2018) - [i125]Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Alexander Svozil:
Algorithms and Conditional Lower Bounds for Planning Problems. CoRR abs/1804.07031 (2018) - [i124]Krishnendu Chatterjee, Hongfei Fu, Amir Kafshdar Goharshady, Nastaran Okati:
Computational Approaches for Stochastic Shortest Path on Succinct MDPs. CoRR abs/1804.08984 (2018) - [i123]Krishnendu Chatterjee, Adrián Elgyütt, Petr Novotný, Owen Rouillé:
Expectation Optimization with Probabilistic Guarantees in POMDPs with Discounted-sum Objectives. CoRR abs/1804.10601 (2018) - [i122]Tomás Brázdil, Krishnendu Chatterjee, Antonín Kucera, Petr Novotný, Dominik Velan, Florian Zuleger:
Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS. CoRR abs/1804.10985 (2018) - [i121]Amir Kafshdar Goharshady, Ali Behrouz, Krishnendu Chatterjee:
Secure Credit Reporting on the Blockchain. CoRR abs/1805.09104 (2018) - [i120]Krishnendu Chatterjee, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, Yaron Velner:
Ergodic Mean-Payoff Games for the Analysis of Attacks in Crypto-Currencies. CoRR abs/1806.03108 (2018) - [i119]Sebastian Arming, Ezio Bartocci, Krishnendu Chatterjee, Joost-Pieter Katoen, Ana Sokolova:
Parameter-Independent Strategies for pMDPs via POMDPs. CoRR abs/1806.05126 (2018) - [i118]Mingzhang Huang, Hongfei Fu, Krishnendu Chatterjee:
New Approaches for Almost-Sure Termination of Probabilistic Programs. CoRR abs/1806.06683 (2018) - [i117]Josef Tkadlec, Andreas Pavlogiannis, Krishnendu Chatterjee, Martin A. Nowak:
Fixation probability and fixation time in structured populations. CoRR abs/1810.02687 (2018) - 2017
- [j65]Krishnendu Chatterjee, Rüdiger Ehlers:
Special issue: Synthesis and SYNT 2014. Acta Informatica 54(6): 543-544 (2017) - [j64]Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop, Yaron Velner:
Quantitative fair simulation games. Inf. Comput. 254: 143-166 (2017) - [j63]Krishnendu Chatterjee, Laurent Doyen, Emmanuel Filiot, Jean-François Raskin:
Doomsday equilibria for omega-regular games. Inf. Comput. 254: 296-315 (2017) - [j62]Krishnendu Chatterjee, Georg Osang:
Pushdown reachability with constant treewidth. Inf. Process. Lett. 122: 25-29 (2017) - [j61]Krishnendu Chatterjee, Yaron Velner:
The Complexity of Mean-Payoff Pushdown Games. J. ACM 64(5): 34:1-34:49 (2017) - [j60]Tomás Brázdil, Krishnendu Chatterjee, Vojtech Forejt, Antonín Kucera:
Trading performance for stability in Markov decision processes. J. Comput. Syst. Sci. 84: 144-170 (2017) - [j59]Krishnendu Chatterjee, Yaron Velner:
Hyperplane separation technique for multidimensional mean-payoff games. J. Comput. Syst. Sci. 88: 236-259 (2017) - [j58]Krishnendu Chatterjee, Nir Piterman:
Obligation Blackwell Games and P-Automata. J. Symb. Log. 82(2): 420-452 (2017) - [j57]Krishnendu Chatterjee, Zuzana Kretínská, Jan Kretínský:
Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes. Log. Methods Comput. Sci. 13(2) (2017) - [j56]Krishnendu Chatterjee, Thomas A. Henzinger, Rasmus Ibsen-Jensen, Jan Otop:
Edit Distance for Pushdown Automata. Log. Methods Comput. Sci. 13(3) (2017) - [j55]Krishnendu Chatterjee, Monika Henzinger, Veronika Loitzenbauer:
Improved Algorithms for Parity and Streett objectives. Log. Methods Comput. Sci. 13(3) (2017) - [j54]Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop:
Nested Weighted Automata. ACM Trans. Comput. Log. 18(4): 31:1-31:44 (2017) - [c172]Krishnendu Chatterjee, Petr Novotný, Guillermo A. Pérez, Jean-François Raskin, Dorde Zikelic:
Optimizing Expectation with Guarantees in POMDPs. AAAI 2017: 3725-3732 - [c171]Krishnendu Chatterjee, Amir Kafshdar Goharshady, Andreas Pavlogiannis:
JTDec: A Tool for Tree Decompositions in Soot. ATVA 2017: 59-66 - [c170]Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger:
The Cost of Exactness in Quantitative Reachability. Models, Algorithms, Logics and Tools 2017: 367-381 - [c169]Krishnendu Chatterjee, Hongfei Fu, Amir Kafshdar Goharshady:
Non-polynomial Worst-Case Analysis of Recursive Programs. CAV (2) 2017: 41-63 - [c168]Krishnendu Chatterjee, Hongfei Fu, Aniket Murhekar:
Automated Recurrence Analysis for Almost-Linear Expected-Runtime Bounds. CAV (1) 2017: 118-139 - [c167]Pranav Ashok, Krishnendu Chatterjee, Przemyslaw Daca, Jan Kretínský, Tobias Meggendorfer:
Value Iteration for Long-Run Average Reward in Markov Decision Processes. CAV (1) 2017: 201-221 - [c166]Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop:
Bidirectional Nested Weighted Automata. CONCUR 2017: 5:1-5:16 - [c165]Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Veronika Loitzenbauer:
Improved Set-Based Symbolic Algorithms for Parity Games. CSL 2017: 18:1-18:21 - [c164]Krishnendu Chatterjee, Bernhard Kragl, Samarth Mishra, Andreas Pavlogiannis:
Faster Algorithms for Weighted Recursive State Machines. ESOP 2017: 287-313 - [c163]Krishnendu Chatterjee, Monika Henzinger, Alexander Svozil:
Faster Algorithms for Mean-Payoff Parity Games. MFCS 2017: 39:1-39:14 - [c162]Krishnendu Chatterjee, Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen:
Strategy Complexity of Concurrent Safety Games. MFCS 2017: 55:1-55:13 - [c161]Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Martin A. Nowak:
Faster Monte-Carlo Algorithms for Fixation Probability of the Moran Process on Undirected Graphs. MFCS 2017: 61:1-61:13 - [c160]Krishnendu Chatterjee, Petr Novotný, Dorde Zikelic:
Stochastic invariants for probabilistic termination. POPL 2017: 145-160 - [i116]Krishnendu Chatterjee, Hongfei Fu:
Termination of Nondeterministic Recursive Probabilistic Programs. CoRR abs/1701.02944 (2017) - [i115]Krishnendu Chatterjee, Bernhard Kragl, Samarth Mishra, Andreas Pavlogiannis:
Faster Algorithms for Weighted Recursive State Machines. CoRR abs/1701.04914 (2017) - [i114]Krishnendu Chatterjee, Hongfei Fu, Aniket Murhekar:
Automated Recurrence Analysis for Almost-Linear Expected-Runtime Bounds. CoRR abs/1705.00314 (2017) - [i113]Krishnendu Chatterjee, Hongfei Fu, Amir Kafshdar Goharshady:
Non-polynomial Worst-Case Analysis of Recursive Programs. CoRR abs/1705.00317 (2017) - [i112]Pranav Ashok, Krishnendu Chatterjee, Przemyslaw Daca, Jan Kretínský, Tobias Meggendorfer:
Value Iteration for Long-run Average Reward in Markov Decision Processes. CoRR abs/1705.02326 (2017) - [i111]Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Veronika Loitzenbauer:
Improved Set-based Symbolic Algorithms for Parity Games. CoRR abs/1706.04889 (2017) - [i110]Krishnendu Chatterjee, Monika Henzinger, Alexander Svozil:
Faster Algorithms for Mean-Payoff Parity Games. CoRR abs/1706.06139 (2017) - [i109]Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Martin A. Nowak:
Faster Monte-Carlo Algorithms for Fixation Probability of the Moran Process on Undirected Graphs. CoRR abs/1706.06931 (2017) - [i108]Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop:
Bidirectional Nested Weighted Automata. CoRR abs/1706.08316 (2017) - [i107]Tomás Brázdil, Krishnendu Chatterjee, Antonín Kucera, Petr Novotný, Dominik Velan:
Efficient Algorithms for Checking Fast Termination in VASS. CoRR abs/1708.09253 (2017) - [i106]Sheshansh Agrawal, Krishnendu Chatterjee, Petr Novotný:
Lexicographic Ranking Supermartingales: An Efficient Approach to Termination of Probabilistic Programs. CoRR abs/1709.04037 (2017) - [i105]Krishnendu Chatterjee, Martin Chmelik, Ufuk Topcu:
Sensor Synthesis for POMDPs with Reachability Objectives. CoRR abs/1710.00675 (2017) - [i104]Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Veronika Loitzenbauer:
Lower Bounds for Symbolic Computation on Graphs: Strongly Connected Components, Liveness, Safety, and Diameter. CoRR abs/1711.09148 (2017) - 2016
- [j53]Krishnendu Chatterjee, Martin Chmelik, Raghav Gupta, Ayush Kanodia:
Optimal cost almost-sure reachability in POMDPs. Artif. Intell. 234: 26-48 (2016) - [j52]Krishnendu Chatterjee, Martin Chmelik, Mathieu Tracol:
What is decidable about partially observable Markov decision processes with ω-regular objectives. J. Comput. Syst. Sci. 82(5): 878-911 (2016) - [c159]Krishnendu Chatterjee, Martin Chmelik, Jessica Davies:
A Symbolic SAT-Based Algorithm for Almost-Sure Reachability with Small Strategies in POMDPs. AAAI 2016: 3225-3232 - [c158]Krishnendu Chatterjee, Martin Chmelik:
Indefinite-Horizon Reachability in Goal-DEC-POMDPs. ICAPS 2016: 88-96 - [c157]Tomás Brázdil, Krishnendu Chatterjee, Martin Chmelik, Anchit Gupta, Petr Novotný:
Stochastic Shortest Path with Energy Constraints in POMDPs: (Extended Abstract). AAMAS 2016: 1465-1466 - [c156]Krishnendu Chatterjee, Hongfei Fu, Amir Kafshdar Goharshady:
Termination Analysis of Probabilistic Programs Through Positivstellensatz's. CAV (1) 2016: 3-22 - [c155]Vineet Pandey, Krishnendu Chatterjee:
Game-theoretic models identify useful principles for peer collaboration in online learning platforms. CSCW Companion 2016: 365-368 - [c154]Krishnendu Chatterjee, Rasmus Ibsen-Jensen:
The Complexity of Deciding Legality of a Single Step of Magic: The Gathering. ECAI 2016: 1432-1439 - [c153]Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Andreas Pavlogiannis:
Optimal Reachability and a Space-Time Tradeoff for Distance Queries in Constant-Treewidth Graphs. ESA 2016: 28:1-28:17 - [c152]Krishnendu Chatterjee, Laurent Doyen:
Computation Tree Logic for Synchronization Properties. ICALP 2016: 98:1-98:14 - [c151]Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Josef Tkadlec:
Robust Draws in Balanced Knockout Tournaments. IJCAI 2016: 172-179 - [c150]Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop:
Quantitative Automata under Probabilistic Semantics. LICS 2016: 76-85 - [c149]Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Veronika Loitzenbauer:
Model and Objective Separation with Conditional Lower Bounds: Disjunction is Harder than Conjunction. LICS 2016: 197-206 - [c148]Krishnendu Chatterjee, Laurent Doyen:
Perfect-Information Stochastic Games with Generalized Mean-Payoff Objectives. LICS 2016: 247-256 - [c147]Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop:
Nested Weighted Limit-Average Automata of Bounded Width. MFCS 2016: 24:1-24:14 - [c146]Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Veronika Loitzenbauer:
Conditionally Optimal Algorithms for Generalized Büchi Games. MFCS 2016: 25:1-25:15 - [c145]Krishnendu Chatterjee, Hongfei Fu, Petr Novotný, Rouzbeh Hasheminezhad:
Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs. POPL 2016: 327-342 - [c144]Krishnendu Chatterjee, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, Andreas Pavlogiannis:
Algorithms for algebraic path properties in concurrent systems of constant treewidth components. POPL 2016: 733-747 - [c143]Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop:
Quantitative Monitor Automata. SAS 2016: 23-38 - [i103]Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Veronika Loitzenbauer:
Model and Objective Separation with Conditional Lower Bounds: Disjunction is Harder than Conjunction. CoRR abs/1602.02670 (2016) - [i102]Tomás Brázdil, Krishnendu Chatterjee, Martin Chmelik, Anchit Gupta, Petr Novotný:
Stochastic Shortest Path with Energy Constraints in POMDPs. CoRR abs/1602.07565 (2016) - [i101]Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Josef Tkadlec:
Robust Draws in Balanced Knockout Tournaments. CoRR abs/1604.05090 (2016) - [i100]Krishnendu Chatterjee, Laurent Doyen:
Perfect-Information Stochastic Games with Generalized Mean-Payoff Objectives. CoRR abs/1604.06376 (2016) - [i99]Krishnendu Chatterjee, Laurent Doyen:
Computation Tree Logic for Synchronization Properties. CoRR abs/1604.06384 (2016) - [i98]Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop:
Quantitative Automata under Probabilistic Semantics. CoRR abs/1604.06764 (2016) - [i97]Krishnendu Chatterjee, Hongfei Fu, Amir Kafshdar Goharshady:
Termination Analysis of Probabilistic Programs through Positivstellensatz's. CoRR abs/1604.07169 (2016) - [i96]Krishnendu Chatterjee, Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai:
Polynomial-Time Algorithms for Energy Games with Special Weight Structures. CoRR abs/1604.08234 (2016) - [i95]Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop:
Nested Weighted Limit-Average Automata of Bounded Width. CoRR abs/1606.03598 (2016) - [i94]Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Veronika Loitzenbauer:
Conditionally Optimal Algorithms for Generalized Büchi Games. CoRR abs/1607.05850 (2016) - [i93]Krishnendu Chatterjee, Andreas Pavlogiannis, Nishant Sinha, Kapil Vaidya:
Data-centric Dynamic Partial Order Reduction. CoRR abs/1610.01188 (2016) - [i92]Krishnendu Chatterjee, Petr Novotný, Dorde Zikelic:
Stochastic Invariants for Probabilistic Termination. CoRR abs/1611.01063 (2016) - [i91]Krishnendu Chatterjee, Petr Novotný, Guillermo A. Pérez, Jean-François Raskin, Dorde Zikelic:
Optimizing Expectation with Guarantees in POMDPs (Technical Report). CoRR abs/1611.08696 (2016) - 2015
- [j51]Krishnendu Chatterjee, Martin Chmelik:
POMDPs under probabilistic semantics. Artif. Intell. 221: 46-72 (2015) - [j50]Krishnendu Chatterjee, Martin Chmelik, Przemyslaw Daca:
CEGAR for compositional analysis of qualitative properties in Markov decision processes. Formal Methods Syst. Des. 47(2): 230-264 (2015) - [j49]Tadeas Priklopil, Krishnendu Chatterjee:
Evolution of Decisions in Population Games with Sequentially Searching Individuals. Games 6(4): 413-437 (2015) - [j48]Krishnendu Chatterjee, Jirí Sgall:
Special Issue for the 38th International Symposium on Mathematical Foundations of Computer Science, MFCS 2013, Klosterneuburg, Austria. Inf. Comput. 240: 1 (2015) - [j47]Yaron Velner, Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger, Alexander Moshe Rabinovich, Jean-François Raskin:
The complexity of multi-mean-payoff and multi-energy games. Inf. Comput. 241: 177-196 (2015) - [j46]Krishnendu Chatterjee, Rasmus Ibsen-Jensen:
Qualitative analysis of concurrent mean-payoff games. Inf. Comput. 242: 2-24 (2015) - [j45]Krishnendu Chatterjee, Laurent Doyen, Mickael Randour, Jean-François Raskin:
Looking at mean-payoff and total-payoff through windows. Inf. Comput. 242: 25-52 (2015) - [j44]Krishnendu Chatterjee, Laurent Doyen, Hugo Gimbert, Thomas A. Henzinger:
Randomness for free. Inf. Comput. 245: 3-16 (2015) - [j43]Béatrice Bérard, Krishnendu Chatterjee, Nathalie Sznajder:
Probabilistic opacity for Markov decision processes. Inf. Process. Lett. 115(1): 52-59 (2015) - [j42]Krishnendu Chatterjee, Thomas A. Henzinger, Barbara Jobstmann, Rohit Singh:
Measuring and Synthesizing Systems in Probabilistic Environments. J. ACM 62(1): 9:1-9:34 (2015) - [j41]Krishnendu Chatterjee, Vinayak S. Prabhu:
Quantitative Temporal Simulation and Refinement Distances for Timed Systems. IEEE Trans. Autom. Control. 60(9): 2291-2306 (2015) - [j40]Krishnendu Chatterjee, Manas Joglekar, Nisarg Shah:
Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives. Theor. Comput. Sci. 573: 71-89 (2015) - [c142]Umair Z. Ahmed, Krishnendu Chatterjee, Sumit Gulwani:
Automatic Generation of Alternative Starting Positions for Simple Traditional Board Games. AAAI 2015: 745-752 - [c141]Krishnendu Chatterjee, Martin Chmelik, Raghav Gupta, Ayush Kanodia:
Optimal Cost Almost-Sure Reachability in POMDPs. AAAI 2015: 3496-3502 - [c140]Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Andreas Pavlogiannis:
Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs. CAV (1) 2015: 140-157 - [c139]Tomás Brázdil, Krishnendu Chatterjee, Martin Chmelik, Andreas Fellner, Jan Kretínský:
Counterexample Explanation by Learning Small Strategies in Markov Decision Processes. CAV (1) 2015: 158-177 - [c138]María Svorenová, Martin Chmelik, Kevin Leahy, Hasan Ferit Eniser, Krishnendu Chatterjee, Ivana Cerná, Calin Belta:
Temporal logic motion planning using POMDPs with parity objectives: case study paper. HSCC 2015: 233-238 - [c137]María Svorenová, Jan Kretínský, Martin Chmelik, Krishnendu Chatterjee, Ivana Cerná, Calin Belta:
Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games. HSCC 2015: 259-268 - [c136]Krishnendu Chatterjee, Laurent Doyen, Moshe Y. Vardi:
The Complexity of Synthesis from Probabilistic Components. ICALP (2) 2015: 108-120 - [c135]Krishnendu Chatterjee, Thomas A. Henzinger, Rasmus Ibsen-Jensen, Jan Otop:
Edit Distance for Pushdown Automata. ICALP (2) 2015: 121-133 - [c134]Krishnendu Chatterjee, Martin Chmelik, Raghav Gupta, Ayush Kanodia:
Qualitative analysis of POMDPs with temporal logic specifications for robotics applications. ICRA 2015: 325-330 - [c133]Krishnendu Chatterjee, Zuzana Komárková, Jan Kretínský:
Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes. LICS 2015: 244-256 - [c132]Krishnendu Chatterjee, Monika Henzinger, Veronika Loitzenbauer:
Improved Algorithms for One-Pair and k-Pair Streett Objectives. LICS 2015: 269-280 - [c131]Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop:
Nested Weighted Automata. LICS 2015: 725-737 - [c130]Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Andreas Pavlogiannis, Prateesh Goyal:
Faster Algorithms for Algebraic Path Properties in Recursive State Machines with Constant Treewidth. POPL 2015: 97-109 - [c129]Krishnendu Chatterjee, Andreas Pavlogiannis, Yaron Velner:
Quantitative Interprocedural Analysis. POPL 2015: 539-551 - [c128]Krishnendu Chatterjee, Rasmus Ibsen-Jensen:
The Value 1 Problem Under Finite-memory Strategies for Concurrent Mean-payoff Games. SODA 2015: 1018-1029 - [c127]Tomás Brázdil, Krishnendu Chatterjee, Vojtech Forejt, Antonín Kucera:
MultiGain: A Controller Synthesis Tool for MDPs with Multiple Mean-Payoff Objectives. TACAS 2015: 181-187 - [c126]Roderick Bloem, Krishnendu Chatterjee, Swen Jacobs, Robert Könighofer:
Assume-Guarantee Synthesis for Concurrent Reactive Programs with Partial Information. TACAS 2015: 517-532 - [i90]Tomás Brázdil, Krishnendu Chatterjee, Vojtech Forejt, Antonín Kucera:
MultiGain: A controller synthesis tool for MDPs with multiple mean-payoff objectives. CoRR abs/1501.03093 (2015) - [i89]Krishnendu Chatterjee, Zuzana Komárková, Jan Kretínský:
Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes. CoRR abs/1502.00611 (2015) - [i88]Tomás Brázdil, Krishnendu Chatterjee, Martin Chmelik, Andreas Fellner, Jan Kretínský:
Counterexample Explanation by Learning Small Strategies in Markov Decision Processes. CoRR abs/1502.02834 (2015) - [i87]Krishnendu Chatterjee, Laurent Doyen, Moshe Y. Vardi:
The Complexity of Synthesis from Probabilistic Components. CoRR abs/1502.04844 (2015) - [i86]Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop:
Nested Weighted Automata. CoRR abs/1504.06117 (2015) - [i85]Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Andreas Pavlogiannis:
Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs. CoRR abs/1504.07384 (2015) - [i84]Krishnendu Chatterjee, Thomas A. Henzinger, Rasmus Ibsen-Jensen, Jan Otop:
Edit Distance for Pushdown Automata. CoRR abs/1504.08259 (2015) - [i83]Krishnendu Chatterjee, Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen:
Strategy Complexity of Concurrent Stochastic Games with Safety and Reachability Objectives. CoRR abs/1506.02434 (2015) - [i82]Krishnendu Chatterjee, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, Andreas Pavlogiannis:
Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components. CoRR abs/1510.07565 (2015) - [i81]Krishnendu Chatterjee, Hongfei Fu, Petr Novotný, Rouzbeh Hasheminezhad:
Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs. CoRR abs/1510.08517 (2015) - [i80]Krishnendu Chatterjee, Martin Chmelik, Jessica Davies:
A Symbolic SAT-based Algorithm for Almost-sure Reachability with Small Strategies in POMDPs. CoRR abs/1511.08456 (2015) - [i79]Krishnendu Chatterjee, Stéphane Lafortune, Nicolas Markey, Wolfgang Thomas:
Non-Zero-Sum-Games and Control (Dagstuhl Seminar 15061). Dagstuhl Reports 5(2): 1-25 (2015) - 2014
- [j39]Krishnendu Chatterjee, Mickael Randour, Jean-François Raskin:
Strategy synthesis for multi-dimensional quantitative objectives. Acta Informatica 51(3-4): 129-163 (2014) - [j38]Roderick Bloem, Krishnendu Chatterjee, Karin Greimel, Thomas A. Henzinger, Georg Hofferek, Barbara Jobstmann, Bettina Könighofer, Robert Könighofer:
Synthesizing robust systems. Acta Informatica 51(3-4): 193-220 (2014) - [j37]Krishnendu Chatterjee, Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai:
Polynomial-Time Algorithms for Energy Games with Special Weight Structures. Algorithmica 70(3): 457-492 (2014) - [j36]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. Log. Methods Comput. Sci. 10(1) (2014) - [j35]Krishnendu Chatterjee, Vishwanath Raman:
Assume-guarantee synthesis for digital contract signing. Formal Aspects Comput. 26(4): 825-859 (2014) - [j34]Krishnendu Chatterjee, Monika Henzinger:
Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition. J. ACM 61(3): 15:1-15:40 (2014) - [j33]Krishnendu Chatterjee, Andreas Pavlogiannis, Ben Adlam, Martin A. Nowak:
The Time Scale of Evolutionary Innovation. PLoS Comput. Biol. 10(9) (2014) - [j32]Krishnendu Chatterjee, Monika Henzinger, Sebastian Krinninger, Veronika Loitzenbauer, Michael A. Raskin:
Approximating the minimum cycle mean. Theor. Comput. Sci. 547: 104-116 (2014) - [j31]Krishnendu Chatterjee, Laurent Doyen:
Partial-Observation Stochastic Games: How to Win when Belief Fails. ACM Trans. Comput. Log. 15(2): 16:1-16:44 (2014) - [j30]Udi Boker, Krishnendu Chatterjee, Thomas A. Henzinger, Orna Kupferman:
Temporal Specifications with Accumulative Values. ACM Trans. Comput. Log. 15(4): 27:1-27:25 (2014) - [c125]Tomás Brázdil, Krishnendu Chatterjee, Martin Chmelik, Vojtech Forejt, Jan Kretínský, Marta Z. Kwiatkowska, David Parker, Mateusz Ujma:
Verification of Markov Decision Processes Using Learning Algorithms. ATVA 2014: 98-114 - [c124]Krishnendu Chatterjee, Martin Chmelik, Przemyslaw Daca:
CEGAR for Qualitative Analysis of Probabilistic Systems. CAV 2014: 473-490 - [c123]Krishnendu Chatterjee:
Qualitative Concurrent Parity Games: Bounded Rationality. CONCUR 2014: 544-559 - [c122]Krishnendu Chatterjee, Laurent Doyen, Hugo Gimbert, Youssouf Oualhadj:
Perfect-Information Stochastic Mean-Payoff Parity Games. FoSSaCS 2014: 210-225 - [c121]Krishnendu Chatterjee, Laurent Doyen, Sumit Nain, Moshe Y. Vardi:
The Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory Strategies. FoSSaCS 2014: 242-257 - [c120]Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Rupak Majumdar:
Edit distance for timed automata. HSCC 2014: 303-312 - [c119]Krishnendu Chatterjee, Laurent Doyen:
Games with a Weak Adversary. ICALP (2) 2014: 110-121 - [c118]Krishnendu Chatterjee, Rasmus Ibsen-Jensen:
The Complexity of Ergodic Mean-payoff Games. ICALP (2) 2014: 122-133 - [c117]Susmit Jha, Stavros Tripakis, Sanjit A. Seshia, Krishnendu Chatterjee:
Game theoretic secure localization in wireless sensor networks. IOT 2014: 85-90 - [c116]Krishnendu Chatterjee:
Partial-Observation Stochastic Reachability and Parity Games. MFCS (1) 2014: 1-4 - [c115]Krishnendu Chatterjee, Andreas Pavlogiannis, Alexander Kößler, Ulrich Schmid:
A Framework for Automated Competitive Analysis of On-line Scheduling of Firm-Deadline Tasks. RTSS 2014: 118-127 - [c114]Krishnendu Chatterjee, Laurent Doyen, Emmanuel Filiot, Jean-François Raskin:
Doomsday Equilibria for Omega-Regular Games. VMCAI 2014: 78-97 - [e3]Krishnendu Chatterjee, Rüdiger Ehlers, Susmit Jha:
Proceedings 3rd Workshop on Synthesis, SYNT 2014, Vienna, Austria, July 23-24, 2014. EPTCS 157, 2014 [contents] - [i78]Krishnendu Chatterjee, Laurent Doyen, Sumit Nain, Moshe Y. Vardi:
The Complexity of Partial-observation Stochastic Parity Games With Finite-memory Strategies. CoRR abs/1401.3289 (2014) - [i77]Tomás Brázdil, Krishnendu Chatterjee, Martin Chmelik, Vojtech Forejt, Jan Kretínský, Marta Z. Kwiatkowska, David Parker, Mateusz Ujma:
Verification of Markov Decision Processes using Learning Algorithms. CoRR abs/1402.2967 (2014) - [i76]Krishnendu Chatterjee, Laurent Doyen:
Games with a Weak Adversary. CoRR abs/1404.5453 (2014) - [i75]Krishnendu Chatterjee, Rasmus Ibsen-Jensen:
The Complexity of Ergodic Mean-payoff Games. CoRR abs/1404.5734 (2014) - [i74]Alexander Zimin, Rasmus Ibsen-Jensen, Krishnendu Chatterjee:
Generalized Risk-Aversion in Stochastic Multi-Armed Bandits. CoRR abs/1405.0833 (2014) - [i73]Krishnendu Chatterjee, Martin Chmelik, Przemyslaw Daca:
CEGAR for Qualitative Analysis of Probabilistic Systems. CoRR abs/1405.0835 (2014) - [i72]Béatrice Bérard, Krishnendu Chatterjee, Nathalie Sznajder:
Probabilistic Opacity for Markov Decision Processes. CoRR abs/1407.4225 (2014) - [i71]Krishnendu Chatterjee, Martin Chmelik:
POMDPs under Probabilistic Semantics. CoRR abs/1408.2058 (2014) - [i70]Krishnendu Chatterjee, Andreas Pavlogiannis, Alexander Kößler, Ulrich Schmid:
A Framework for Automated Competitive Analysis of On-line Scheduling of Firm-Deadline Tasks. CoRR abs/1409.2291 (2014) - [i69]Krishnendu Chatterjee, Martin Chmelik, Raghav Gupta, Ayush Kanodia:
Qualitative Analysis of POMDPs with Temporal Logic Specifications for Robotics Applications. CoRR abs/1409.3360 (2014) - [i68]Krishnendu Chatterjee, Rasmus Ibsen-Jensen:
Qualitative Analysis of Concurrent Mean-payoff Games. CoRR abs/1409.5306 (2014) - [i67]Krishnendu Chatterjee, Rasmus Ibsen-Jensen:
The Value 1 Problem Under Finite-memory Strategies for Concurrent Mean-payoff Games. CoRR abs/1409.6690 (2014) - [i66]Krishnendu Chatterjee, Monika Henzinger, Veronika Loitzenbauer:
Improved Algorithms for One-Pair and k-Pair Streett Objectives. CoRR abs/1410.0833 (2014) - [i65]María Svorenová, Jan Kretínský, Martin Chmelik, Krishnendu Chatterjee, Ivana Cerná, Calin Belta:
Temporal Logic Control for Stochastic Linear Systems using Abstraction Refinement of Probabilistic Games. CoRR abs/1410.5387 (2014) - [i64]Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Andreas Pavlogiannis, Prateesh Goyal:
Faster Algorithms for Algebraic Path Properties in RSMs with Constant Treewidth. CoRR abs/1410.7724 (2014) - [i63]Krishnendu Chatterjee, Martin Chmelik, Raghav Gupta, Ayush Kanodia:
Optimal Cost Almost-sure Reachability in POMDPs. CoRR abs/1411.3880 (2014) - [i62]Umair Z. Ahmed, Krishnendu Chatterjee, Sumit Gulwani:
Automatic Generation of Alternative Starting Positions for Simple Traditional Board Games. CoRR abs/1411.4023 (2014) - [i61]Roderick Bloem, Krishnendu Chatterjee, Swen Jacobs, Robert Könighofer:
Assume-Guarantee Synthesis for Concurrent Reactive Programs with Partial Information. CoRR abs/1411.4604 (2014) - 2013
- [j29]Krishnendu Chatterjee, Luca de Alfaro, Marco Faella, Rupak Majumdar, Vishwanath Raman:
Code aware resource management. Formal Methods Syst. Des. 42(2): 146-174 (2013) - [j28]Krishnendu Chatterjee, Monika Henzinger, Manas Joglekar, Nisarg Shah:
Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives. Formal Methods Syst. Des. 42(3): 301-327 (2013) - [j27]Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger:
A survey of partial-observation stochastic parity games. Formal Methods Syst. Des. 43(2): 268-284 (2013) - [j26]Krishnendu Chatterjee, Vinayak S. Prabhu:
Synthesis of memory-efficient, clock-memory free, and non-Zeno safety controllers for timed systems. Inf. Comput. 228: 83-119 (2013) - [j25]Krishnendu Chatterjee, Luca de Alfaro, Rupak Majumdar:
The Complexity of Coverage. Int. J. Found. Comput. Sci. 24(2): 165-186 (2013) - [j24]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) - [j23]Yashdeep Godhal, Krishnendu Chatterjee, Thomas A. Henzinger:
Synthesis of AMBA AHB from formal specification: a case study. Int. J. Softw. Tools Technol. Transf. 15(5-6): 585-601 (2013) - [c113]Krishnendu Chatterjee, Laurent Doyen, Mickael Randour, Jean-François Raskin:
Looking at Mean-Payoff and Total-Payoff through Windows. ATVA 2013: 118-132 - [c112]Johannes G. Reiter, Ivana Bozic, Krishnendu Chatterjee, Martin A. Nowak:
TTP: Tool for Tumor Progression. CAV 2013: 101-106 - [c111]Krishnendu Chatterjee, Jakub Lacki:
Faster Algorithms for Markov Decision Processes with Low Treewidth. CAV 2013: 543-558 - [c110]Krishnendu Chatterjee, Andreas Gaiser, Jan Kretínský:
Automata with Generalized Rabin Pairs for Probabilistic Model Checking and LTL Synthesis. CAV 2013: 559-575 - [c109]Krishnendu Chatterjee, Yaron Velner:
Hyperplane Separation Technique for Multidimensional Mean-Payoff Games. CONCUR 2013: 500-515 - [c108]Krishnendu Chatterjee, Martin Chmelik, Mathieu Tracol:
What is Decidable about Partially Observable Markov Decision Processes with omega-Regular Objectives. CSL 2013: 165-180 - [c107]Krishnendu Chatterjee, Nathanaël Fijalkow:
Infinite-state games with finitary conditions. CSL 2013: 181-196 - [c106]Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop, Andreas Pavlogiannis:
Distributed synthesis for LTL fragments. FMCAD 2013: 18-25 - [c105]Krishnendu Chatterjee, Alexander Kößler, Ulrich Schmid:
Automated analysis of real-time scheduling using graph games. HSCC 2013: 163-172 - [c104]Krishnendu Chatterjee, Vinayak S. Prabhu:
Quantitative timed simulation functions and refinement metrics for real-time systems. HSCC 2013: 273-282 - [c103]Krishnendu Chatterjee, Siddhesh Chaubal, Sasha Rubin:
How to Travel between Languages. LATA 2013: 214-225 - [c102]Tomás Brázdil, Krishnendu Chatterjee, Vojtech Forejt, Antonín Kucera:
Trading Performance for Stability in Markov Decision Processes. LICS 2013: 331-340 - [c101]Krishnendu Chatterjee, Vojtech Forejt, Dominik Wojtczak:
Multi-objective Discounted Reward Verification in Graphs and MDPs. LPAR 2013: 228-242 - [c100]Krishnendu Chatterjee, Martin Chmelik:
POMDPs under Probabilistic Semantics. UAI 2013 - [c99]Krishnendu Chatterjee, Monika Henzinger, Sebastian Krinninger, Veronika Loitzenbauer:
Approximating the minimum cycle mean. GandALF 2013: 136-149 - [e2]Krishnendu Chatterjee, Jirí Sgall:
Mathematical Foundations of Computer Science 2013 - 38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013. Proceedings. Lecture Notes in Computer Science 8087, Springer 2013, ISBN 978-3-642-40312-5 [contents] - [i60]Krishnendu Chatterjee, Nathanaël Fijalkow:
Infinite-state games with finitary conditions. CoRR abs/1301.2661 (2013) - [i59]Krishnendu Chatterjee, Laurent Doyen, Mickael Randour, Jean-François Raskin:
Looking at Mean-Payoff and Total-Payoff through Windows. CoRR abs/1302.4248 (2013) - [i58]Johannes G. Reiter, Ivana Bozic, Krishnendu Chatterjee, Martin A. Nowak:
TTP: Tool for Tumor Progression. CoRR abs/1303.5251 (2013) - [i57]Krishnendu Chatterjee, Jakub Lacki:
Faster Algorithms for Markov Decision Processes with Low Treewidth. CoRR abs/1304.0084 (2013) - [i56]Krishnendu Chatterjee, Andreas Gaiser, Jan Kretínský:
Automata with Generalized Rabin Pairs for Probabilistic Model Checking and LTL Synthesis. CoRR abs/1304.5281 (2013) - [i55]Tomás Brázdil, Krishnendu Chatterjee, Vojtech Forejt, Antonín Kucera:
Trading Performance for Stability in Markov Decision Processes. CoRR abs/1305.4103 (2013) - [i54]Krishnendu Chatterjee, Martin Chmelik:
POMDPs under Probabilistic Semantics. CoRR abs/1308.4846 (2013) - [i53]Krishnendu Chatterjee, Martin Chmelik, Mathieu Tracol:
What is Decidable about Partially Observable Markov Decision Processes with ω-Regular Objectives. CoRR abs/1309.2802 (2013) - [i52]Krishnendu Chatterjee, Laurent Doyen, Emmanuel Filiot, Jean-François Raskin:
Doomsday Equilibria for Omega-Regular Games. CoRR abs/1311.3238 (2013) - 2012
- [j22]Krishnendu Chatterjee:
The complexity of stochastic Müller games. Inf. Comput. 211: 29-48 (2012) - [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]Krishnendu Chatterjee, Laurent Doyen:
Energy parity games. Theor. Comput. Sci. 458: 49-60 (2012) - [j18]Krishnendu Chatterjee, Suneet Tuli:
Image Enhancement in Transient Lock-In Thermography Through Time Series Reconstruction and Spatial Slope Correction. IEEE Trans. Instrum. Meas. 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]Krishnendu Chatterjee, Yaron Velner:
Mean-Payoff Pushdown Games. LICS 2012: 195-204 - [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 - [i51]Krishnendu Chatterjee, Yaron Velner:
Mean-Payoff Pushdown Games. CoRR abs/1201.2829 (2012) - [i50]Krishnendu Chatterjee, Luca de Alfaro, Thomas A. Henzinger:
Strategy Improvement for Concurrent Reachability and Safety Games. CoRR abs/1201.2834 (2012) - [i49]Krishnendu Chatterjee, Siddhesh Chaubal, Pritish Kamath:
Faster Algorithms for Alternating Refinement Relations. CoRR abs/1201.4449 (2012) - [i48]Krishnendu Chatterjee, Mickael Randour, Jean-François Raskin:
Strategy Synthesis for Multi-dimensional Quantitative Objectives. CoRR abs/1201.5073 (2012) - [i47]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) - [i46]Krishnendu Chatterjee, Martin Chmelik, Rupak Majumdar:
Equivalence of Games with Probabilistic Uncertainty and Partial-observation Games. CoRR abs/1202.4140 (2012) - [i45]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) - [i44]Krishnendu Chatterjee, Nir Piterman:
Obligation Blackwell Games and p-Automata. CoRR abs/1206.5174 (2012) - [i43]Krishnendu Chatterjee, Thomas A. Henzinger, Ranjit Jhala, Rupak Majumdar:
Counterexample-guided Planning. CoRR abs/1207.1373 (2012) - [i42]Krishnendu Chatterjee, Thomas A. Henzinger, Vinayak S. Prabhu:
Finite Automata with Time-Delay Blocks (Extended Version). CoRR abs/1207.7019 (2012) - [i41]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) - [i40]Krishnendu Chatterjee, Rasmus Ibsen-Jensen:
Strategy complexity of finite-horizon Markov decision processes and simple stochastic games. CoRR abs/1209.3617 (2012) - [i39]Krishnendu Chatterjee, Yaron Velner:
Finite-State and Pushdown Games with Multi-dimensional Mean-Payoff Objectives. CoRR abs/1210.3141 (2012) - [i38]Krishnendu Chatterjee, Vinayak S. Prabhu:
Quantitative Timed Simulation Functions and Refinement Metrics for Timed Systems (Full Version). CoRR abs/1212.6556 (2012) - [i37]Nikolaj S. 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. Log. Methods Comput. Sci. 7(4) (2011) - [j16]Krishnendu Chatterjee, Luca de Alfaro, Thomas A. Henzinger:
Qualitative concurrent parity games. ACM Trans. Comput. Log. 12(4): 28:1-28:51 (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]Krishnendu Chatterjee, Nathanaël Fijalkow:
Finitary Languages. LATA 2011: 216-226 - [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]Krishnendu Chatterjee:
Graph Games with Reachability Objectives - (Invited Talk). RP 2011: 1 - [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 - [i36]Krishnendu Chatterjee, Nathanaël Fijalkow:
Finitary languages. CoRR abs/1101.1727 (2011) - [i35]Krishnendu Chatterjee, Vinayak S. Prabhu:
Synthesis of Memory-Efficient Real-Time Controllers for Safety Objectives (Full Version). CoRR abs/1101.5842 (2011) - [i34]Krishnendu Chatterjee, Thomas A. Henzinger, Mathieu Tracol:
The Decidability Frontier for Probabilistic Automata on Infinite Words. CoRR abs/1104.0127 (2011) - [i33]Krishnendu Chatterjee, Laurent Doyen:
Energy and Mean-Payoff Parity Markov Decision Processes. CoRR abs/1104.2909 (2011) - [i32]Krishnendu Chatterjee, Laurent Doyen, Rohit Singh:
On Memoryless Quantitative Objectives. CoRR abs/1104.3211 (2011) - [i31]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) - [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]Krishnendu Chatterjee:
Bounded Rationality in Concurrent Parity Games. CoRR abs/1107.2146 (2011) - [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). Log. Methods Comput. Sci. 6(3) (2010) - [j14]Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger:
Expressiveness and Closure Properties for Quantitative Languages. Log. Methods Comput. Sci. 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): 23:1-23:38 (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]Krishnendu Chatterjee, Florian Horn, Christof Löding:
Obliging Games. CONCUR 2010: 284-296 - [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]Krishnendu Chatterjee, Laurent Doyen:
Energy Parity Games. ICALP (2) 2010: 599-610 - [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]Krishnendu Chatterjee, Rupak Majumdar:
Discounting in Games across Time Scales. GANDALF 2010: 22-29 - [e1]Krishnendu Chatterjee, Thomas A. Henzinger:
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 [contents] - [i23]Yashdeep Godhal, Krishnendu Chatterjee, Thomas A. Henzinger:
Synthesis of AMBA AHB from Formal Specification. CoRR abs/1001.2811 (2010) - [i22]Krishnendu Chatterjee, Laurent Doyen:
Energy Parity Games. CoRR abs/1001.5183 (2010) - [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. Log. Methods Comput. Sci. 5(2) (2009) - [j9]Krishnendu Chatterjee, Thomas A. Henzinger, Florian Horn:
Finitary winning in omega-regular games. ACM Trans. Comput. Log. 11(1): 1:1-1:27 (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]Krishnendu Chatterjee, Luca de Alfaro, Ian Pye:
Robust content-driven reputation. AISec 2008: 33-42 - [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]Krishnendu Chatterjee:
Linear Time Algorithm for Weak Parity Games. CoRR abs/0805.1391 (2008) - [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. Log. Methods Comput. Sci. 3(3) (2007) - [j5]Krishnendu Chatterjee:
Concurrent games with tail objectives. Theor. Comput. Sci. 388(1-3): 181-198 (2007) - [c33]Krishnendu Chatterjee, Thomas A. Henzinger, Nir Piterman:
Strategy Logic. CONCUR 2007: 59-73 - [c32]Krishnendu Chatterjee:
Optimal Strategy Synthesis in Stochastic Müller Games. FoSSaCS 2007: 138-152 - [c31]Krishnendu Chatterjee, Thomas A. Henzinger, Nir Piterman:
Generalized Parity Games. FoSSaCS 2007: 153-167 - [c30]Krishnendu Chatterjee:
Stochastic Müller Games are PSPACE-Complete. FSTTCS 2007: 436-448 - [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]Krishnendu Chatterjee, Thomas A. Henzinger:
Assume-Guarantee Synthesis. TACAS 2007: 261-275 - [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]Krishnendu Chatterjee, Radha Jagadeesan, Corin Pitcher:
Games for Controls. CSFW 2006: 70-84 - [c23]Krishnendu Chatterjee:
Concurrent Games with Tail Objectives. CSL 2006: 256-270 - [c22]Krishnendu Chatterjee:
Nash Equilibrium for Upward-Closed Objectives. CSL 2006: 271-286 - [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]Krishnendu Chatterjee:
Two-Player Nonzero-Sum omega-Regular Games. CONCUR 2005: 413-427 - [c12]Krishnendu Chatterjee, Thomas A. Henzinger:
Semiperfect-Information Games. FSTTCS 2005: 1-18 - [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. Reason. 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
Martin Chmelik
aka: Martin Chmelík
aka: Martin Chmelík
[j94] [j89] [e4] [c217] [i161] [c195] [i129] [j63] [c170] [c152] [c148] [i100] [i99] [j47] [j45] [j44] [c136] [i87] [j31] [c122] [c121] [c119] [c114] [i78] [i76] [j27] [c113] [i59] [i52] [j19] [c90] [i41] [c81] [c74] [c73] [i33] [i32] [i26] [j14] [j12] [j11] [c63] [c60] [c59] [c58] [c57] [c56] [i22] [i18] [i17] [i16] [c53] [c52] [c51] [c50] [c47] [i15] [i13] [i12] [i11] [c43] [c42] [j6] [i1] [c21]
[j93] [c246] [i190] [i182] [c234] [i177] [c225] [c223] [c214] [c212] [c208] [c205] [c202] [i155] [i153] [i150] [i149] [i147] [j75] [j74] [j73] [j72] [c196] [c193] [c191] [c190] [i146] [i145] [i144] [i142] [j66] [c183] [c182] [c180] [c178] [i132] [i124] [i121] [i120] [c171] [c169] [i113] [c156] [c144] [i97] [i82]
[c237] [c236] [c235] [c230] [c227] [i173] [c226] [i171] [i167] [i166] [i165] [c215] [i157] [i156] [c206] [i151] [j77] [c200] [c197] [i140] [c185] [j64] [j56] [j54] [c170] [c166] [i108] [c150] [c147] [c143] [i98] [i95] [j47] [j44] [j42] [c135] [c131] [i86] [i84] [j38] [j30] [j27] [j24] [j23] [c106] [j20] [c94] [i50] [i43] [i42] [i41] [j17] [j16] [c84] [c82] [c77] [c75] [c71] [c69] [i34] [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]
Raimundo Saona
aka: Raimundo Saona Urmeneta
aka: Raimundo Saona Urmeneta
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-27 00:46 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
