51 citations · 122 across the 7 of their papers we have counts for
4 papers · 1 filter
Approximating Values of Generalized-Reachability Stochastic Games
Pranav Ashok, Krishnendu Chatterjee, Jan Kretinsky +2
Simple stochastic games are turn-based 2.5-player games with a reachability objective. The basic question asks whether one player can ensure reaching a given target with at least a…
Strategy Representation by Decision Trees with Linear Classifiers
Pranav Ashok, Tomáš Brázdil, Krishnendu Chatterjee +3
Graph games and Markov decision processes (MDPs) are standard models in reactive synthesis and verification of probabilistic systems with nondeterminism. The class of -regular w…
SOS: Safe, Optimal and Small Strategies for Hybrid Markov Decision Processes
Pranav Ashok, Jan Křetínský, Kim Guldstrand Larsen +3
For hybrid Markov decision processes, UPPAAL Stratego can compute strategies that are safe for a given safety property and (in the limit) optimal for a given cost function. Unfortu…
PAC Statistical Model Checking for Markov Decision Processes and Stochastic Games
Pranav Ashok, Jan Křetínský, Maximilian Weininger
Statistical model checking (SMC) is a technique for analysis of probabilistic systems that may be (partially) unknown. We present an SMC algorithm for (unbounded) reachability yiel…