Tomás Brázdil

发表

Synthesizing Efficient Solutions for Patrolling Problems in the Internet Environment pdf

Tomás Brázdil, Antonín Kucera, Vojtech Rehák, 2018, ArXiv.

Runtime Analysis of Probabilistic Programs with Unbounded Recursion pdf

Tomás Brázdil, Stefan Kiefer, Antonín Kucera, 2010, ICALP.

Verification of Markov Decision Processes Using Learning Algorithms

Krishnendu Chatterjee, Jan Kretínský, Tomás Brázdil, 2014, ATVA.

Minimizing Expected Termination Time in One-Counter Markov Decision Processes pdf

Petr Novotný, Tomás Brázdil, Antonín Kucera, 2012, ICALP.

Qualitative Reachability in Stochastic BPA Games

Tomás Brázdil, Antonín Kucera, Jan Obdrzálek, 2009, STACS.

Computing the Expected Accumulated Reward and Gain for a Subclass of Infinite Markov Chains

Tomás Brázdil, Antonín Kucera, A. Kucera, 2005, FSTTCS.

On the Decidability of Temporal Properties of Probabilistic Pushdown Automata

Tomás Brázdil, Antonín Kucera, Oldrich Strazovský, 2005, STACS.

Measuring performance of continuous-time stochastic processes using timed automata pdf

Jan Kretínský, Tomás Brázdil, Vojtech Rehák, 2011, HSCC '11.

Verification of Open Interactive Markov Chains

Holger Hermanns, Jan Kretínský, Tomás Brázdil, 2012, FSTTCS.

Branching-time model-checking of probabilistic pushdown automata

Tomás Brázdil, Antonín Kucera, Vojtech Forejt, 2014, J. Comput. Syst. Sci..

Solving Patrolling Problems in the Internet Environment

Tomás Brázdil, Vojtech Rehák, Antonín Kucera, 2018, IJCAI.

Long-Run Average Behaviour of Probabilistic Vector Addition Systems

Petr Novotný, Tomás Brázdil, Stefan Kiefer, 2015, 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science.

Analysis and prediction of the long-run behavior of probabilistic sequential programs with recursion

Javier Esparza, Tomás Brázdil, Antonín Kucera, 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

Reachability in recursive Markov decision processes

Tomás Brázdil, Antonín Kucera, Vojtech Forejt, 2008, Inf. Comput..

Space-Efficient Scheduling of Stochastically Generated Tasks

Michael Luttenberger, Javier Esparza, Tomás Brázdil, 2010, ICALP.

Stability in Graphs and Games

Petr Novotný, Tomás Brázdil, Antonín Kucera, 2016, CONCUR.

Continuous-Time Stochastic Games with Time-Bounded Reachability

Jan Kretínský, Tomás Brázdil, Antonín Kucera, 2009, FSTTCS.

Reachability Games on Extended Vector Addition Systems with States pdf

Tomás Brázdil, Antonín Kucera, Petr Jancar, 2010, ICALP.

Space-efficient scheduling of stochastically generated tasks

Michael Luttenberger, Javier Esparza, Tomás Brázdil, 2010, Inf. Comput..

One-Counter Stochastic Games pdf

Kousha Etessami, Tomás Brázdil, Václav Brozek, 2010, FSTTCS.

On time-average limits in deterministic and stochastic petri nets

Jan Kretínský, Tomás Brázdil, Vojtech Rehák, 2013, ICPE '13.

Minimizing Running Costs in Consumption Systems

Petr Novotný, Tomás Brázdil, Antonín Kucera, 2014, CAV.

Efficient Controller Synthesis for Consumption Games with Multiple Resource Types

Krishnendu Chatterjee, Petr Novotný, Tomás Brázdil, 2012, CAV.

Policy Learning for Time-Bounded Reachability in Continuous-Time Markov Decision Processes via Doubly-Stochastic Gradient Ascent

Ezio Bartocci, Guido Sanguinetti, Tomás Brázdil, 2016, QEST.

Discounted Properties of Probabilistic Pushdown Automata

Tomás Brázdil, Antonín Kucera, Václav Brozek, 2008, LPAR.

Strategy Representation by Decision Trees in Reactive Synthesis

Krishnendu Chatterjee, Jan Kretínský, Tomás Brázdil, 2018, TACAS.

Stochastic Real-Time Games with Qualitative Timed Automata Objectives

Jan Kretínský, Tomás Brázdil, Vojtech Rehák, 2010, CONCUR.

Deciding probabilistic bisimilarity over infinite-state probabilistic systems

Tomás Brázdil, Antonín Kucera, Oldrich Strazovský, 2004, Acta Informatica.

Controller Synthesis and Verification for Markov Decision Processes with Qualitative Branching Time Objectives

Tomás Brázdil, Antonín Kucera, Vojtech Forejt, 2008, ICALP.

Optimizing Performance of Continuous-Time Stochastic Systems using Timeout Synthesis

Petr Novotný, Tomás Brázdil, Vojtech Rehák, 2014, QEST.

Approximating the termination value of one-counter MDPs and stochastic games

Kousha Etessami, Tomás Brázdil, Antonín Kucera, 2013, Inf. Comput..

Model Checking of RegCTL

Ivana Cerná, Tomás Brázdil, 2006, Comput. Artif. Intell..

Deciding Fast Termination for Probabilistic VASS with Nondeterminism pdf

Krishnendu Chatterjee, Petr Novotný, Tomás Brázdil, 2019, ATVA.

Efficient Analysis of Probabilistic Programs with an Unbounded Counter

Tomás Brázdil, Stefan Kiefer, Antonín Kucera, 2014, JACM.

On the Memory Consumption of Probabilistic Pushdown Automata

Javier Esparza, Tomás Brázdil, Stefan Kiefer, 2009, FSTTCS.

Stabilization of Branching Queueing Networks pdf

Tomás Brázdil, Stefan Kiefer, S. Kiefer, 2011, STACS.

Policy learning in continuous-time Markov decision processes using Gaussian Processes

Ezio Bartocci, Guido Sanguinetti, Tomás Brázdil, 2017, Perform. Evaluation.

Strategy Synthesis in Adversarial Patrolling Games pdf

Tomás Brázdil, Vojtech Rehák, Antonín Kucera, 2015, ArXiv.

Solvency Markov Decision Processes with Interest pdf

Petr Novotný, Tomás Brázdil, Taolue Chen, 2013, FSTTCS.

Monte Carlo Tree Search for Verifying Reachability in Markov Decision Processes

Jan Kretínský, Tomás Brázdil, Pranav Ashok, 2018, ISoLA.

Stochastic Shortest Path with Energy Constraints in POMDPs: (Extended Abstract) pdf

Krishnendu Chatterjee, Petr Novotný, Tomás Brázdil, 2016, AAMAS.

Branching-Time Model-Checking of Probabilistic Pushdown Automata

Tomás Brázdil, Vojtech Forejt, Václav Brozek, 2009, INFINITY.

Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes

Krishnendu Chatterjee, Tomás Brázdil, Antonín Kucera, 2011, 2011 IEEE 26th Annual Symposium on Logic in Computer Science.

Trading Performance for Stability in Markov Decision Processes

Krishnendu Chatterjee, Tomás Brázdil, Antonín Kucera, 2013, 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science.

Analyzing probabilistic pushdown automata

Javier Esparza, Tomás Brázdil, Stefan Kiefer, 2013, Formal Methods Syst. Des..

Continuous-Time Stochastic Games with Time-Bounded Reachability

Jan Kretínský, Tomás Brázdil, Antonín Kucera, 2013, FSTTCS.

Strategy Representation by Decision Trees with Linear Classifiers

Christoph H. Lampert, Krishnendu Chatterjee, Jan Kretínský, 2019, QEST.

One-counter Markov decision processes

Kousha Etessami, Tomás Brázdil, Antonín Kucera, 2009, SODA '10.

Stochastic Game Logic

Christel Baier, Tomás Brázdil, Marcus Größer, 2007, QEST.

The Satisfiability Problem for Probabilistic CTL

Jan Kretínský, Tomás Brázdil, Antonín Kucera, 2008, 2008 23rd Annual IEEE Symposium on Logic in Computer Science.

Strategy Synthesis for Markov Decision Processes and Branching-Time Logics

Tomás Brázdil, Vojtech Forejt, 2007, CONCUR.

Solving adversarial patrolling games with bounded error: (extended abstract)

Branislav Bosanský, Tomás Brázdil, Vojtech Rehák, 2014, AAMAS.

Determinacy in Stochastic Games with Unbounded Payoff Functions

Petr Novotný, Tomás Brázdil, Antonín Kucera, 2012, MEMICS.

Reachability in Recursive Markov Decision Processes

Tomás Brázdil, Antonín Kucera, Vojtech Forejt, 2006, CONCUR.

Stochastic games with branching-time winning objectives

Tomás Brázdil, Antonín Kucera, Vojtech Forejt, 2006, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06).

Deciding Probabilistic Bisimilarity Over Infinite-State Probabilistic Systems

Tomás Brázdil, Antonín Kucera, Oldrich Strazovský, 2004, CONCUR.

Fixed-Delay Events in Generalized Semi-Markov Processes Revisited

Jan Kretínský, Tomás Brázdil, Vojtech Rehák, 2011, CONCUR.

Approximating the Termination Value of One-Counter MDPs and Stochastic Games pdf

Kousha Etessami, Tomás Brázdil, Antonín Kucera, 2011, ICALP.

Qualitative reachability in stochastic BPA games pdf

Tomás Brázdil, Antonín Kucera, Jan Obdrzálek, 2011, Inf. Comput..

Counterexample Explanation by Learning Small Strategies in Markov Decision Processes

Krishnendu Chatterjee, Andreas Fellner, Jan Kretínský, 2015, CAV.

Stochastic game logic

Christel Baier, Tomás Brázdil, Marcus Größer, 2007, Fourth International Conference on the Quantitative Evaluation of Systems (QEST 2007).

Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS

Krishnendu Chatterjee, Petr Novotný, Tomás Brázdil, 2018, LICS.

Efficient Algorithms for Checking Fast Termination in VASS pdf

Krishnendu Chatterjee, Petr Novotný, Tomás Brázdil, 2017, ArXiv.

Efficient Analysis of Probabilistic Programs with an Unbounded Counter

Tomás Brázdil, Stefan Kiefer, Antonín Kucera, 2011, CAV.

Zero-reachability in probabilistic multi-counter automata

Joost-Pieter Katoen, Petr Novotný, Tomás Brázdil, 2014, CSL-LICS.

MultiGain: A Controller Synthesis Tool for MDPs with Multiple Mean-Payoff Objectives

Krishnendu Chatterjee, Tomás Brázdil, Antonín Kucera, 2015, TACAS.

Optimizing the Expected Mean Payoff in Energy Markov Decision Processes

Petr Novotný, Tomás Brázdil, Antonín Kucera, 2016, ATVA.

Local Distributed Model Checking of RegCTL

Ivana Cerná, Tomás Brázdil, 2002, Electron. Notes Theor. Comput. Sci..

Runtime analysis of probabilistic programs with unbounded recursion

Tomás Brázdil, Stefan Kiefer, Antonín Kucera, 2015, J. Comput. Syst. Sci..