Václav Brožek

Computer Science · Physical Sciences

12h-index399citations27works0.02yr avg
OpenAlex↗Google Scholar↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Formal Methods in Verification(19), Logic, programming, and type systems(13), semigroups and automata theory(5), Petri Nets in System Modeling(4), Simulation Techniques and Applications(4)

Publications27 total

Markov Decision Processes with Multiple Long-run Average Objectives
Logical Methods in Computer Science·2014· 44 citedOpen Access
Branching-time model-checking of probabilistic pushdown automata
Journal of Computer and System Sciences·2013· 8 cited
Determinacy and optimal strategies in infinite-state stochastic reachability games
Theoretical Computer Science·2012· 2 cited
Approximating the termination value of one-counter MDPs and stochastic games
Information and Computation·2012· 17 citedOpen Access
Optimal Strategies in Infinite-state Stochastic Reachability Games
Electronic Proceedings in Theoretical Computer Science·2011· 2 citedOpen Access
Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes
2011· 41 cited
Qualitative reachability in stochastic BPA games
Information and Computation·2011· 35 citedOpen Access
Approximating the Termination Value of One-Counter MDPs and Stochastic Games
arXiv (Cornell University)·2011· 2 citedOpen Access
Approximating the Termination Value of One-Counter MDPs and Stochastic\n Games
arXiv (Cornell University)·2011Open Access
Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes
arXiv (Cornell University)·2011· 45 citedOpen Access
Approximating the Termination Value of One-Counter MDPs and Stochastic Games
Lecture notes in computer science·2011· 21 citedOpen Access
One-Counter Stochastic Games
arXiv (Cornell University)·2010Open Access
One-Counter Markov Decision Processes
2010· 28 cited
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '10)
2010· 26 cited
One-Counter Stochastic Games
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2010· 46 citedOpen Access
Regularity in PDA Games Revisited
Electronic Notes in Theoretical Computer Science·2009Open Access
Branching-Time Model-Checking of Probabilistic Pushdown Automata
Electronic Notes in Theoretical Computer Science·2009· 5 citedOpen Access
One-Counter Markov Decision Processes
ArXiv.org·2009· 1 citedOpen Access
Qualitative Reachability in Stochastic BPA Games
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2009· 10 citedOpen Access
Basic Model Checking Problems for Stochastic Games
2009· 2 cited
page 1 of 2Next →

Frequent Co-authors

Tomǎš Brázdil(20), Antonı́n Kučera(17), Kousha Etessami(9), Vojtěch Forejt(9), Krishnendu Chatterjee(3), Jan Óbdržálek(2), Dominik Wojtczak(2), Tomas Br ́zdil(1), D. Wojtczak(1), Jan Holeček(1)