1 citations · 2 across the 10 of their papers we have counts for
10 papers
Quantitative Analysis of -Regular Robust MDPs
Ali Asadi, Krishnendu Chatterjee, Ehsan Kafshdar Goharshady +3
Robust Markov Decision Processes (RMDPs) generalize classical MDPs by allowing uncertainty in transition probabilities and optimizing against their worst-case realization. We consi…
Automated Approach for Solving Infinite-state Polynomial Reachability Games
Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Mehrdad Karrabi +2
Reachability games are two-player games played on a graph, where the objective of player is to reach the target set whereas the objective of player…
Strongly Polynomial Time Complexity of Policy Iteration for Robust MDPs
Ali Asadi, Krishnendu Chatterjee, Ehsan Goharshady +3
Markov decision processes (MDPs) are a fundamental model in sequential decision making. Robust MDPs (RMDPs) extend this framework by allowing uncertainty in transition probabilitie…
Qualitative Analysis of -Regular Objectives on Robust MDPs
Ali Asadi, Krishnendu Chatterjee, Ehsan Kafshdar Goharshady +2
Robust Markov Decision Processes (RMDPs) generalize classical MDPs that consider uncertainties in transition probabilities by defining a set of possible transition functions. An ob…
Quantified Linear and Polynomial Arithmetic Satisfiability via Template-based Skolemization
Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Mehrdad Karrabi +3
The problem of checking satisfiability of linear real arithmetic (LRA) and non-linear real arithmetic (NRA) formulas has broad applications, in particular, they are at the heart of…
PolyQEnt: A Polynomial Quantified Entailment Solver
Krishnendu Chatterjee, Amir Kafshdar Goharshady, Ehsan Kafshdar Goharshady +4
Polynomial quantified entailments with existentially and universally quantified variables arise in many problems of verification and program analysis. We present PolyQEnt which is…
Fully Automated Selfish Mining Analysis in Efficient Proof Systems Blockchains
Krishnendu Chatterjee, Amirali Ebrahimzadeh, Mehrdad Karrabi +3
We study selfish mining attacks in longest-chain blockchains like Bitcoin, but where the proof of work is replaced with efficient proof systems -- like proofs of stake or proofs of…
Sound and Complete Witnesses for Template-based Verification of LTL Properties on Polynomial Programs
Krishnendu Chatterjee, Amir Kafshdar Goharshady, Ehsan Kafshdar Goharshady +2
We study the classical problem of verifying programs with respect to formal specifications given in the linear temporal logic (LTL). We first present novel sound and complete witne…
Solving Long-run Average Reward Robust MDPs via Stochastic Games
Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Mehrdad Karrabi +2
Markov decision processes (MDPs) provide a standard framework for sequential decision making under uncertainty. However, MDPs do not take uncertainty in transition probabilities in…
Game Dynamics and Equilibrium Computation in the Population Protocol Model
Dan Alistarh, Krishnendu Chatterjee, Mehrdad Karrabi +1
We initiate the study of game dynamics in the population protocol model: agents each maintain a current local strategy and interact in pairs uniformly at random. Upon each inte…