47 citations · 115 across the 33 of their papers we have counts for
5 papers · 1 filter
One-Counter Stochastic Games
Tomáš Brázdil, Václav Brožek, Kousha Etessami
We study the computational complexity of basic decision problems for one-counter simple stochastic games (OC-SSGs), under various objectives. OC-SSGs are 2-player turn-based stocha…
Runtime Analysis of Probabilistic Programs with Unbounded Recursion
Tomas Brazdil, Stefan Kiefer, Antonin Kucera +1
We study termination time and recurrence time in programs with unbounded recursion, which are either randomized or operate on some statistically quantified inputs. As the underlyin…
Space-efficient scheduling of stochastically generated tasks
Tomáš Brázdil, Javier Esparza, Stefan Kiefer +1
We study the problem of scheduling tasks for execution by a processor when the tasks can stochastically generate new tasks. Tasks can be of different types, and each type has a fix…
Qualitative Reachability in Stochastic BPA Games
Tomáš Brázdil, Václav Brožek, Antonín Kučera +1
We consider a class of infinite-state stochastic games generated by stateless pushdown automata (or, equivalently, 1-exit recursive state machines), where the winning objective is…
Reachability Games on Extended Vector Addition Systems with States
Tomas Brazdil, Petr Jancar, Antonin Kucera
We consider two-player turn-based games with zero-reachability and zero-safety objectives generated by extended vector addition systems with states. Although the problem of decidin…