2 papers
cs.DM2022
Upper Bounds for All and Max-gain Policy Iteration Algorithms on Deterministic MDPs
Ritesh Goenka, Eashan Gupta, Sushil Khyalia +3
Policy Iteration (PI) is a widely used family of algorithms to compute optimal policies for Markov Decision Problems (MDPs). We derive upper bounds on the running time of PI on Det…
cs.PL2021
Stateless Model Checking under a Reads-Value-From Equivalence
Pratyush Agarwal, Krishnendu Chatterjee, Shreya Pathak +2
Stateless model checking (SMC) is one of the standard approaches to the verification of concurrent programs. As scheduling non-determinism creates exponentially large spaces of thr…