Stochastic Games with Branching-Time Winning Objectives. - Tomás Brázdil; Václav Brozek; Vojtech Forejt; Antonín Kucera 001 (LICS, 2006)

Discounted Properties of Probabilistic Pushdown Automata. - Tomás Brázdil; Václav Brozek; Jan Holecek; Antonín Kucera 001 (LPAR, 2008)

Regularity in PDA Games Revisited. - Václav Brozek (MEMICS, 2008)

Reachability in recursive Markov decision processes. - Tomás Brázdil; Václav Brozek; Vojtech Forejt; Antonín Kucera 001 (Inf. Comput., 2008)

Branching-Time Model-Checking of Probabilistic Pushdown Automata. - Tomás Brázdil; Václav Brozek; Vojtech Forejt (INFINITY, 2009)

One-Counter Stochastic Games. - Tomás Brázdil; Václav Brozek; Kousha Etessami (FSTTCS, 2010)

One-Counter Markov Decision Processes. - Tomás Brázdil; Václav Brozek; Kousha Etessami; Antonín Kucera 001; Dominik Wojtczak (SODA, 2010)

Optimal Strategies in Infinite-state Stochastic Reachability Games - Václav Brozek (GandALF, 2011)

Qualitative reachability in stochastic BPA games. - Tomás Brázdil; Václav Brozek; Antonín Kucera 001; Jan Obdrzálek (Inf. Comput., 2011)

Approximating the termination value of one-counter MDPs and stochastic games. - Tomás Brázdil; Václav Brozek; Kousha Etessami; Antonín Kucera 001 (Inf. Comput., 2013)

Determinacy and optimal strategies in infinite-state stochastic reachability games. - Václav Brozek (Theor. Comput. Sci., 2013)

Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes - Tomás Brázdil; Václav Brozek; Krishnendu Chatterjee; Vojtech Forejt; Antonín Kucera 001 (Log. Methods Comput. Sci., 2014)

Branching-time model-checking of probabilistic pushdown automata. - Tomás Brázdil; Václav Brozek; Vojtech Forejt; Antonín Kucera 001 (J. Comput. Syst. Sci., 2014)