47 citations · 144 across the 34 of their papers we have counts for
3 papers · 1 filter
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…
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…