Vojtech Rehák

Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, 2020

2019

Mean-payoff Optimization in Continuous-time Markov Chains with Parametric Alarms.

[BibT_eX]

[DOI]

ACM Trans. Model. Comput. Simul., 2019

PROLEMus: A Proactive Learning-Based MAC Protocol Against PUEA and SSDF Attacks in Energy Constrained Cognitive Radio Networks.

[BibT_eX]

[DOI]

IEEE Trans. Cogn. Commun. Netw., 2019

2018

Synthesizing Efficient Solutions for Patrolling Problems in the Internet Environment.

[BibT_eX]

[DOI]

Tomás Brázdil

CoRR, 2018

Solving Patrolling Problems in the Internet Environment.

[BibT_eX]

[DOI]

Tomás Brázdil

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

Automatic Synthesis of Efficient Regular Strategies in Adversarial Patrolling Games.

[BibT_eX]

[DOI]

Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018

2017

Synthesis of Optimal Resilient Control Strategies.

[BibT_eX]

[DOI]

CoRR, 2017

Synthesis of Optimal Resilient Control Strategies.

[BibT_eX]

[DOI]

Proceedings of the Automated Technology for Verification and Analysis, 2017

2016

Efficient Timeout Synthesis in Fixed-Delay CTMC Using Policy Iteration.

[BibT_eX]

[DOI]

Lubos Korenciak

Proceedings of the 24th IEEE International Symposium on Modeling, 2016

Extension of PRISM by Synthesis of Optimal Timeouts in Fixed-Delay CTMC.

[BibT_eX]

[DOI]

Lubos Korenciak

Adrian Farmadin

Proceedings of the Integrated Formal Methods - 12th International Conference, 2016

2015

Strategy Synthesis in Adversarial Patrolling Games.

[BibT_eX]

[DOI]

CoRR, 2015

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

[BibT_eX]

[DOI]

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

2014

Dealing with Zero Density Using Piecewise Phase-Type Approximation.

[BibT_eX]

[DOI]

Lubos Korenciak

Jan Krcál

Proceedings of the Computer Performance Engineering - 11th European Workshop, 2014

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

[BibT_eX]

[DOI]

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

2013

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

[BibT_eX]

[DOI]

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

2012

LTL to Büchi Automata Translation: Fast and More Deterministic.

[BibT_eX]

[DOI]

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

Controllable-Choice Message Sequence Graphs.

[BibT_eX]

[DOI]

Martin Chmelik

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

Verification of Open Interactive Markov Chains.

[BibT_eX]

[DOI]

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

Sequence Chart Studio.

[BibT_eX]

[DOI]

Proceedings of the 12th International Conference on Application of Concurrency to System Design, 2012

2011

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

[BibT_eX]

[DOI]

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

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

[BibT_eX]

[DOI]

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

2010

Decidable Race Condition and Open Coregions in HMSC.

[BibT_eX]

[DOI]

Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2010

A Short Story of a Subtle Error in LTL Formulas Reduction and Divine Incorrectness

[BibT_eX]

[DOI]

CoRR, 2010

Stochastic Real-Time Games with Qualitative Timed Automata Objectives.

[BibT_eX]

[DOI]

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

2009

Reachability is decidable for weakly extended process rewrite systems.

[BibT_eX]

[DOI]

Inf. Comput., 2009

On Decidability of LTL+Past Model Checking for Process Rewrite Systems.

[BibT_eX]

[DOI]

Proceedings of the Joint Proceedings of the 8th, 2009

Almost Linear Büchi Automata

[BibT_eX]

[DOI]

Tomás Babiak

Proceedings of the Proceedings 16th International Workshop on Expressiveness in Concurrency, 2009

On decidability of LTL model checking for process rewrite systems.

[BibT_eX]

[DOI]

Acta Informatica, 2009

2008

Petri nets are less expressive than state-extended PA.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

2006

Verifying VHDL Designs with Multiple Clocks in SMV.

[BibT_eX]

[DOI]

Proceedings of the Formal Methods: Applications and Technology, 2006

2005

Refining the Undecidability Border of Weak Bisimilarity.

[BibT_eX]

[DOI]

Proceedings of the 7th International Workshop on Verification of Infinite-State Systems, 2005

Reachability of Hennessy-Milner Properties for Weakly Extended PRS.

[BibT_eX]

[DOI]

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

2004

Extended Process Rewrite Systems: Expressiveness and Reachability.

[BibT_eX]

[DOI]

Proceedings of the CONCUR 2004 - Concurrency Theory, 15th International Conference, London, UK, August 31, 2004

2003

On Extensions of Process Rewrite Systems: Rewrite Systems with Weak Finite-State Unit.

[BibT_eX]

[DOI]