Tomás Brázdil

According to our database, Tomás Brázdil authored at least 67 papers between 2002 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Learning Algorithms for Verification of Markov Decision Processes.

Tomás Brázdil, Krishnendu Chatterjee, Martin Chmelik, Vojtech Forejt, Jan Kretínský, Marta Kwiatkowska, Tobias Meggendorfer, David Parker, Mateusz Ujma

CoRR, 2024

2023

xOpat: eXplainable Open Pathology Analysis Tool.

Jirí Horák, Katarína Furmanová, Barbora Kozlíková, Tomás Brázdil, Petr Holub, M. Kacenga, Matej Gallo, R. Nenutil, Jan Byska, Vít Rusnák

Comput. Graph. Forum, June, 2023

2022

On-the-fly adaptation of patrolling strategies in changing environments.

Tomás Brázdil, David Klaska, Antonín Kucera, Vít Musil, Petr Novotný, Vojtech Rehák

Proceedings of the Uncertainty in Artificial Intelligence, 2022

2020

Qualitative Controller Synthesis for Consumption Markov Decision Processes.

Frantisek Blahoudek, Tomás Brázdil, Petr Novotný, Melkior Ornik, Pranay Thangeda, Ufuk Topcu

Proceedings of the Computer Aided Verification - 32nd International Conference, 2020

Reinforcement Learning of Risk-Constrained Policies in Markov Decision Processes.

Tomás Brázdil, Krishnendu Chatterjee, Petr Novotný, Jiri Vahala

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019

Strategy Representation by Decision Trees with Linear Classifiers.

Pranav Ashok, Tomás Brázdil, Krishnendu Chatterjee, Jan Kretínský, Christoph H. Lampert, Viktor Toman

Proceedings of the Quantitative Evaluation of Systems, 16th International Conference, 2019

Deciding Fast Termination for Probabilistic VASS with Nondeterminism.

Tomás Brázdil, Krishnendu Chatterjee, Antonín Kucera, Petr Novotný, Dominik Velan

Proceedings of the Automated Technology for Verification and Analysis, 2019

Unbounded Orchestrations of Transducers for Manufacturing.

Natasha Alechina, Tomás Brázdil, Giuseppe De Giacomo, Paolo Felli, Brian Logan, Moshe Y. Vardi

Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018

Synthesizing Efficient Solutions for Patrolling Problems in the Internet Environment.

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

CoRR, 2018

Strategy Representation by Decision Trees in Reactive Synthesis.

Tomás Brázdil, Krishnendu Chatterjee, Jan Kretínský, Viktor Toman

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2018

Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS.

Tomás Brázdil, Krishnendu Chatterjee, Antonín Kucera, Petr Novotný, Dominik Velan, Florian Zuleger

Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

Monte Carlo Tree Search for Verifying Reachability in Markov Decision Processes.

Pranav Ashok, Tomás Brázdil, Jan Kretínský, Ondrej Slámecka

Proceedings of the Leveraging Applications of Formal Methods, Verification and Validation. Verification, 2018

Solving Patrolling Problems in the Internet Environment.

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

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

2017

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

Ezio Bartocci, Luca Bortolussi, Tomás Brázdil, Dimitrios Milios, Guido Sanguinetti

Perform. Evaluation, 2017

Trading performance for stability in Markov decision processes.

Tomás Brázdil, Krishnendu Chatterjee, Vojtech Forejt, Antonín Kucera

J. Comput. Syst. Sci., 2017

Efficient Algorithms for Checking Fast Termination in VASS.

Tomás Brázdil, Krishnendu Chatterjee, Antonín Kucera, Petr Novotný, Dominik Velan

CoRR, 2017

2016

Stochastic Shortest Path with Energy Constraints in POMDPs.

Tomás Brázdil, Krishnendu Chatterjee, Martin Chmelik, Anchit Gupta, Petr Novotný

CoRR, 2016

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

Ezio Bartocci, Luca Bortolussi, Tomás Brázdil, Dimitrios Milios, Guido Sanguinetti

Proceedings of the Quantitative Evaluation of Systems - 13th International Conference, 2016

Stability in Graphs and Games.

Tomás Brázdil, Vojtech Forejt, Antonín Kucera, Petr Novotný

Proceedings of the 27th International Conference on Concurrency Theory, 2016

Optimizing the Expected Mean Payoff in Energy Markov Decision Processes.

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

Proceedings of the Automated Technology for Verification and Analysis, 2016

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

Tomás Brázdil, Krishnendu Chatterjee, Martin Chmelik, Anchit Gupta, Petr Novotný

Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, 2016

2015

Runtime analysis of probabilistic programs with unbounded recursion.

Tomás Brázdil, Stefan Kiefer, Antonín Kucera, Ivana Hutarová Vareková

J. Comput. Syst. Sci., 2015

Strategy Synthesis in Adversarial Patrolling Games.

Tomás Brázdil, Petr Hlinený, Antonín Kucera, Vojtech Rehák, Matús Abaffy

CoRR, 2015

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

Tomás Brázdil, Krishnendu Chatterjee, Vojtech Forejt, Antonín Kucera

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2015

Optimizing Performance of Continuous-Time Stochastic Systems Using Timeout Synthesis.

Tomás Brázdil, Lubos Korenciak, Jan Krcál, Petr Novotný, Vojtech Rehák

Proceedings of the Quantitative Evaluation of Systems, 12th International Conference, 2015

Long-Run Average Behaviour of Probabilistic Vector Addition Systems.

Tomás Brázdil, Stefan Kiefer, Antonín Kucera, Petr Novotný

Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

Counterexample Explanation by Learning Small Strategies in Markov Decision Processes.

Tomás Brázdil, Krishnendu Chatterjee, Martin Chmelik, Andreas Fellner, Jan Kretínský

Proceedings of the Computer Aided Verification - 27th International Conference, 2015

2014

Branching-time model-checking of probabilistic pushdown automata.

Tomás Brázdil, Václav Brozek, Vojtech Forejt, Antonín Kucera

J. Comput. Syst. Sci., 2014

Efficient Analysis of Probabilistic Programs with an Unbounded Counter.

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

J. ACM, 2014

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

Log. Methods Comput. Sci., 2014

Zero-reachability in probabilistic multi-counter automata.

Tomás Brázdil, Stefan Kiefer, Antonín Kucera, Petr Novotný, Joost-Pieter Katoen

Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2014

Minimizing Running Costs in Consumption Systems.

Tomás Brázdil, David Klaska, Antonín Kucera, Petr Novotný

Proceedings of the Computer Aided Verification - 26th International Conference, 2014

Verification of Markov Decision Processes Using Learning Algorithms.

Tomás Brázdil, Krishnendu Chatterjee, Martin Chmelik, Vojtech Forejt, Jan Kretínský, Marta Z. Kwiatkowska, David Parker, Mateusz Ujma

Proceedings of the Automated Technology for Verification and Analysis, 2014

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

Michal Abaffy, Tomás Brázdil, Vojtech Rehák, Branislav Bosanský, Antonín Kucera, Jan Krcál

Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2014

2013

Continuous-time stochastic games with time-bounded reachability.

Tomás Brázdil, Vojtech Forejt, Jan Krcál, Jan Kretínský, Antonín Kucera

Inf. Comput., 2013

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

Tomás Brázdil, Václav Brozek, Kousha Etessami, Antonín Kucera

Inf. Comput., 2013

Analyzing probabilistic pushdown automata.

Tomás Brázdil, Javier Esparza, Stefan Kiefer, Antonín Kucera

Formal Methods Syst. Des., 2013

On time-average limits in deterministic and stochastic petri nets.

Tomás Brázdil, Lubos Korenciak, Jan Krcál, Jan Kretínský, Vojtech Rehák

Proceedings of the ACM/SPEC International Conference on Performance Engineering, 2013

Solvency Markov Decision Processes with Interest.

Tomás Brázdil, Taolue Chen, Vojtech Forejt, Petr Novotný, Aistis Simaitis

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2013

2012

Space-efficient scheduling of stochastically generated tasks.

Tomás Brázdil, Javier Esparza, Stefan Kiefer, Michael Luttenberger

Inf. Comput., 2012

Stochastic game logic.

Christel Baier, Tomás Brázdil, Marcus Größer, Antonín Kucera

Acta Informatica, 2012

Stabilization of Branching Queueing Networks.

Tomás Brázdil, Stefan Kiefer

Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, 2012

Determinacy in Stochastic Games with Unbounded Payoff Functions.

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

Proceedings of the Mathematical and Engineering Methods in Computer Science, 2012

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

Tomás Brázdil, Antonín Kucera, Petr Novotný, Dominik Wojtczak

Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

Verification of Open Interactive Markov Chains.

Tomás Brázdil, Holger Hermanns, Jan Krcál, Jan Kretínský, Vojtech Rehák

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2012

Efficient Controller Synthesis for Consumption Games with Multiple Resource Types.

Tomás Brázdil, Krishnendu Chatterjee, Antonín Kucera, Petr Novotný

Proceedings of the Computer Aided Verification - 24th International Conference, 2012

2011

Qualitative reachability in stochastic BPA games.

Tomás Brázdil, Václav Brozek, Antonín Kucera, Jan Obdrzálek

Inf. Comput., 2011

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

Tomás Brázdil, Jan Krcál, Jan Kretínský, Antonín Kucera, Vojtech Rehák

Proceedings of the 14th ACM International Conference on Hybrid Systems: Computation and Control, 2011

Fixed-Delay Events in Generalized Semi-Markov Processes Revisited.

Tomás Brázdil, Jan Krcál, Jan Kretínský, Vojtech Rehák

Proceedings of the CONCUR 2011 - Concurrency Theory - 22nd International Conference, 2011

2010

One-Counter Markov Decision Processes.

Tomás Brázdil, Václav Brozek, Kousha Etessami, Antonín Kucera, Dominik Wojtczak

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Reachability Games on Extended Vector Addition Systems with States.

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

Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

One-Counter Stochastic Games.

Tomás Brázdil, Václav Brozek, Kousha Etessami

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2010

Stochastic Real-Time Games with Qualitative Timed Automata Objectives.

Tomás Brázdil, Jan Krcál, Jan Kretínský, Antonín Kucera, Vojtech Rehák

Proceedings of the CONCUR 2010 - Concurrency Theory, 21th International Conference, 2010

2009

Branching-Time Model-Checking of Probabilistic Pushdown Automata.

Tomás Brázdil, Václav Brozek, Vojtech Forejt

Proceedings of the Joint Proceedings of the 8th, 2009

On the Memory Consumption of Probabilistic Pushdown Automata.

Tomás Brázdil, Javier Esparza, Stefan Kiefer

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2009

2008

Reachability in recursive Markov decision processes.

Tomás Brázdil, Václav Brozek, Vojtech Forejt, Antonín Kucera

Inf. Comput., 2008

Deciding probabilistic bisimilarity over infinite-state probabilistic systems.

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

Acta Informatica, 2008

Discounted Properties of Probabilistic Pushdown Automata.

Tomás Brázdil, Václav Brozek, Jan Holecek, Antonín Kucera

Proceedings of the Logic for Programming, 2008

The Satisfiability Problem for Probabilistic CTL.

Tomás Brázdil, Vojtech Forejt, Jan Kretínský, Antonín Kucera

Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, 2008

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

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

Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

2007

Strategy Synthesis for Markov Decision Processes and Branching-Time Logics.

Tomás Brázdil, Vojtech Forejt

Proceedings of the CONCUR 2007 - Concurrency Theory, 18th International Conference, 2007

2006

Model Checking of RegCTL.

Tomás Brázdil, Ivana Cerná

Comput. Artif. Intell., 2006

Stochastic Games with Branching-Time Winning Objectives.

Tomás Brázdil, Václav Brozek, Vojtech Forejt, Antonín Kucera

Proceedings of the 21th IEEE Symposium on Logic in Computer Science (LICS 2006), 2006

2005

On the Decidability of Temporal Properties of Probabilistic Pushdown Automata.

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

Proceedings of the STACS 2005, 2005

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

Tomás Brázdil, Antonín Kucera

Proceedings of the FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science, 2005

Analysis and Prediction of the Long-Run Behavior of Probabilistic Sequential Programs with Recursion (Extended Abstract).

Tomás Brázdil, Javier Esparza, Antonín Kucera

Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 2005

2002

Local Distributed Model Checking of RegCTL.

Tomás Brázdil, Ivana Cerná

Proceedings of the Parallel and Distributed Model Checking, 2002