51 citations · 122 across the 7 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.LO2018
Monte Carlo Tree Search for Verifying Reachability in Markov Decision Processes
Pranav Ashok, Tomáš Brázdil, Jan Křetínský +1
The maximum reachability probabilities in a Markov decision process can be computed using value iteration (VI). Recently, simulation-based heuristic extensions of VI have been intr…
eess.SY2018
Continuous-Time Markov Decisions based on Partial Exploration
Pranav Ashok, Yuliya Butkova, Holger Hermanns +1
We provide a framework for speeding up algorithms for time-bounded reachability analysis of continuous-time Markov decision processes. The principle is to find a small, but almost…