Showing cs.LOShow all
3 papers · 1 filter
cs.LO2020
DeepAbstract: Neural Network Abstraction for Accelerating Verification
Pranav Ashok, Vahid Hashemi, Jan Křetínský +1
While abstraction is a classic tool of verification to scale it up, it is not used very often for verifying neural networks. However, it can help with the still open task of scalin…
cs.LO2019
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…
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…