47 citations · 115 across the 33 of their papers we have counts for
11 papers · 1 filter
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…
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…
Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS
Tomáš Brázdil, Krishnendu Chatterjee, Antonín Kučera +3
Vector Addition Systems with States (VASS) provide a well-known and fundamental model for the analysis of concurrent processes, parameterized systems, and are also used as abstract…
Strategy Representation by Decision Trees in Reactive Synthesis
Tomáš Brázdil, Krishnendu Chatterjee, Jan Křetínský +1
Graph games played by two players over finite-state graphs are central in many problems in computer science. In particular, graph games with -regular winning conditions, specifi…
Efficient Algorithms for Checking Fast Termination in VASS
Tomáš Brázdil, Krishnendu Chatterjee, Antonín Kučera +2
Vector Addition Systems with States (VASS) consists of a finite state space equipped with d counters, where in each transition every counter is incremented, decremented, or left un…
Optimizing the Expected Mean Payoff in Energy Markov Decision Processes
Tomáš Brázdil, Antonín Kučera, Petr Novotný
Energy Markov Decision Processes (EMDPs) are finite-state Markov decision processes where each transition is assigned an integer counter update and a rational payoff. An EMDP confi…