Tomás Brázdil

According to our database1, Tomás Brázdil
  • authored at least 91 papers between 2002 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2017
Policy learning in continuous-time Markov decision processes using Gaussian Processes.
Perform. Eval., 2017

Trading performance for stability in Markov decision processes.
J. Comput. Syst. Sci., 2017

Efficient Algorithms for Checking Fast Termination in VASS.
CoRR, 2017

2016
Optimizing the Expected Mean Payoff in Energy Markov Decision Processes.
CoRR, 2016

Stability in Graphs and Games.
CoRR, 2016

Stochastic Shortest Path with Energy Constraints in POMDPs.
CoRR, 2016

Policy learning for time-bounded reachability in Continuous-Time Markov Decision Processes via doubly-stochastic gradient ascent.
CoRR, 2016

Policy Learning for Time-Bounded Reachability in Continuous-Time Markov Decision Processes via Doubly-Stochastic Gradient Ascent.
Proceedings of the Quantitative Evaluation of Systems - 13th International Conference, 2016

Stability in Graphs and Games.
Proceedings of the 27th International Conference on Concurrency Theory, 2016

Optimizing the Expected Mean Payoff in Energy Markov Decision Processes.
Proceedings of the Automated Technology for Verification and Analysis, 2016

Stochastic Shortest Path with Energy Constraints in POMDPs: (Extended Abstract).
Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, 2016

2015
Runtime analysis of probabilistic programs with unbounded recursion.
J. Comput. Syst. Sci., 2015

Long-Run Average Behaviour of Probabilistic Vector Addition Systems.
CoRR, 2015

Strategy Synthesis in Adversarial Patrolling Games.
CoRR, 2015

MultiGain: A controller synthesis tool for MDPs with multiple mean-payoff objectives.
CoRR, 2015

Counterexample Explanation by Learning Small Strategies in Markov Decision Processes.
CoRR, 2015

MultiGain: A Controller Synthesis Tool for MDPs with Multiple Mean-Payoff Objectives.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2015

Optimizing Performance of Continuous-Time Stochastic Systems Using Timeout Synthesis.
Proceedings of the Quantitative Evaluation of Systems, 12th International Conference, 2015

Long-Run Average Behaviour of Probabilistic Vector Addition Systems.
Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

Counterexample Explanation by Learning Small Strategies in Markov Decision Processes.
Proceedings of the Computer Aided Verification - 27th International Conference, 2015

2014
Branching-time model-checking of probabilistic pushdown automata.
J. Comput. Syst. Sci., 2014

Efficient Analysis of Probabilistic Programs with an Unbounded Counter.
J. ACM, 2014

Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes
Logical Methods in Computer Science, 2014

Optimizing Performance of Continuous-Time Stochastic Systems using Timeout Synthesis.
CoRR, 2014

Zero-Reachability in Probabilistic Multi-Counter Automata.
CoRR, 2014

Minimizing Running Costs in Consumption Systems.
CoRR, 2014

Verification of Markov Decision Processes using Learning Algorithms.
CoRR, 2014

Zero-reachability in probabilistic multi-counter automata.
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.
Proceedings of the Computer Aided Verification - 26th International Conference, 2014

Verification of Markov Decision Processes Using Learning Algorithms.
Proceedings of the Automated Technology for Verification and Analysis, 2014

Solving adversarial patrolling games with bounded error: (extended abstract).
Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2014

2013
Continuous-time stochastic games with time-bounded reachability.
Inf. Comput., 2013

Approximating the termination value of one-counter MDPs and stochastic games.
Inf. Comput., 2013

Analyzing probabilistic pushdown automata.
Formal Methods in System Design, 2013

Trading Performance for Stability in Markov Decision Processes
CoRR, 2013

Solvency Markov Decision Processes with Interest.
CoRR, 2013

On time-average limits in deterministic and stochastic petri nets.
Proceedings of the ACM/SPEC International Conference on Performance Engineering, 2013

Trading Performance for Stability in Markov Decision Processes.
Proceedings of the 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 2013

Solvency Markov Decision Processes with Interest.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2013

2012
Space-efficient scheduling of stochastically generated tasks.
Inf. Comput., 2012

Determinacy in Stochastic Games with Unbounded Payoff Functions
CoRR, 2012

Minimizing Expected Termination Time in One-Counter Markov Decision Processes
CoRR, 2012

Efficient Controller Synthesis for Consumption Games with Multiple Resource Types
CoRR, 2012

Stochastic game logic.
Acta Inf., 2012

Stabilization of Branching Queueing Networks.
Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, 2012

Determinacy in Stochastic Games with Unbounded Payoff Functions.
Proceedings of the Mathematical and Engineering Methods in Computer Science, 2012

Minimizing Expected Termination Time in One-Counter Markov Decision Processes.
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

Verification of Open Interactive Markov Chains.
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.
Proceedings of the Computer Aided Verification - 24th International Conference, 2012

2011
Qualitative reachability in stochastic BPA games.
Inf. Comput., 2011

Stabilization of Branching Queueing Networks
CoRR, 2011

Fixed-delay Events in Generalized Semi-Markov Processes Revisited
CoRR, 2011

Approximating the Termination Value of One-Counter MDPs and Stochastic Games
CoRR, 2011

Efficient Analysis of Probabilistic Programs with an Unbounded Counter
CoRR, 2011

Measuring Performance of Continuous-Time Stochastic Processes using Timed Automata
CoRR, 2011

Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes.
Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science, 2011

Runtime Analysis of Probabilistic Programs with Unbounded Recursion.
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

Approximating the Termination Value of One-Counter MDPs and Stochastic Games.
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

Measuring performance of continuous-time stochastic processes using timed automata.
Proceedings of the 14th ACM International Conference on Hybrid Systems: Computation and Control, 2011

Fixed-Delay Events in Generalized Semi-Markov Processes Revisited.
Proceedings of the CONCUR 2011 - Concurrency Theory - 22nd International Conference, 2011

Efficient Analysis of Probabilistic Programs with an Unbounded Counter.
Proceedings of the Computer Aided Verification - 23rd International Conference, 2011

2010
One-Counter Stochastic Games
CoRR, 2010

Runtime Analysis of Probabilistic Programs with Unbounded Recursion
CoRR, 2010

Space-efficient scheduling of stochastically generated tasks
CoRR, 2010

Qualitative Reachability in Stochastic BPA Games
CoRR, 2010

Reachability Games on Extended Vector Addition Systems with States
CoRR, 2010

One-Counter Markov Decision Processes.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Reachability Games on Extended Vector Addition Systems with States.
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

Space-Efficient Scheduling of Stochastically Generated Tasks.
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

One-Counter Stochastic Games.
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.
Proceedings of the CONCUR 2010 - Concurrency Theory, 21th International Conference, 2010

2009
Branching-Time Model-Checking of Probabilistic Pushdown Automata.
Electr. Notes Theor. Comput. Sci., 2009

One-Counter Markov Decision Processes
CoRR, 2009

Qualitative Reachability in Stochastic BPA Games.
Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009

Continuous-Time Stochastic Games with Time-Bounded Reachability.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2009

On the Memory Consumption of Probabilistic Pushdown Automata.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2009

2008
Reachability in recursive Markov decision processes.
Inf. Comput., 2008

Deciding probabilistic bisimilarity over infinite-state probabilistic systems.
Acta Inf., 2008

Discounted Properties of Probabilistic Pushdown Automata.
Proceedings of the Logic for Programming, 2008

The Satisfiability Problem for Probabilistic CTL.
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.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

2007
Stochastic Game Logic.
Proceedings of the Fourth International Conference on the Quantitative Evaluaiton of Systems (QEST 2007), 2007

Strategy Synthesis for Markov Decision Processes and Branching-Time Logics.
Proceedings of the CONCUR 2007 - Concurrency Theory, 18th International Conference, 2007

2006
Model Checking of RegCTL.
Computers and Artificial Intelligence, 2006

Stochastic Games with Branching-Time Winning Objectives.
Proceedings of the 21th IEEE Symposium on Logic in Computer Science (LICS 2006), 2006

Reachability in Recursive Markov Decision Processes.
Proceedings of the CONCUR 2006 - Concurrency Theory, 17th International Conference, 2006

2005
On the Decidability of Temporal Properties of Probabilistic Pushdown Automata.
Proceedings of the STACS 2005, 2005

Computing the Expected Accumulated Reward and Gain for a Subclass of Infinite Markov Chains.
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).
Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 2005

2004
Deciding Probabilistic Bisimilarity Over Infinite-State Probabilistic Systems.
Proceedings of the CONCUR 2004 - Concurrency Theory, 15th International Conference, London, UK, August 31, 2004

2002
Local Distributed Model Checking of RegCTL.
Electr. Notes Theor. Comput. Sci., 2002


  Loading...