Vojtech Rehák

According to our database1, Vojtech Rehák authored at least 30 papers between 2004 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.



In proceedings 
PhD thesis 



On csauthors.net:


PROLEMus: A Proactive Learning-Based MAC Protocol Against PUEA and SSDF Attacks in Energy Constrained Cognitive Radio Networks.
IEEE Trans. Cogn. Comm. & Networking, 2019

Solving Patrolling Problems in the Internet Environment.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Automatic Synthesis of Efficient Regular Strategies in Adversarial Patrolling Games.
Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018

Mean-Payoff Optimization in Continuous-Time Markov Chains with Parametric Alarms.
Proceedings of the Quantitative Evaluation of Systems - 14th International Conference, 2017

Synthesis of Optimal Resilient Control Strategies.
Proceedings of the Automated Technology for Verification and Analysis, 2017

Efficient Timeout Synthesis in Fixed-Delay CTMC Using Policy Iteration.
Proceedings of the 24th IEEE International Symposium on Modeling, 2016

Extension of PRISM by Synthesis of Optimal Timeouts in Fixed-Delay CTMC.
Proceedings of the Integrated Formal Methods - 12th International Conference, 2016

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

Dealing with Zero Density Using Piecewise Phase-Type Approximation.
Proceedings of the Computer Performance Engineering - 11th European Workshop, 2014

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

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

Almost linear Büchi automata.
Mathematical Structures in Computer Science, 2012

LTL to Büchi Automata Translation: Fast and More Deterministic.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2012

Controllable-Choice Message Sequence Graphs.
Proceedings of the Mathematical and Engineering Methods in Computer Science, 2012

Verification of Open Interactive Markov Chains.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2012

Sequence Chart Studio.
Proceedings of the 12th International Conference on Application of Concurrency to System Design, 2012

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

Decidable Race Condition and Open Coregions in HMSC.

Stochastic Real-Time Games with Qualitative Timed Automata Objectives.
Proceedings of the CONCUR 2010 - Concurrency Theory, 21th International Conference, 2010

Reachability is decidable for weakly extended process rewrite systems.
Inf. Comput., 2009

On Decidability of LTL+Past Model Checking for Process Rewrite Systems.
Electr. Notes Theor. Comput. Sci., 2009

Almost Linear Büchi Automata
Proceedings of the Proceedings 16th International Workshop on Expressiveness in Concurrency, 2009

Petri nets are less expressive than state-extended PA.
Theor. Comput. Sci., 2008

Refining the Undecidability Border of Weak Bisimilarity.
Electr. Notes Theor. Comput. Sci., 2006

On Decidability of LTL Model Checking for Process Rewrite Systems.
Proceedings of the FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science, 2006

Verifying VHDL Designs with Multiple Clocks in SMV.
Proceedings of the Formal Methods: Applications and Technology, 2006

Reachability of Hennessy-Milner Properties for Weakly Extended PRS.
Proceedings of the FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science, 2005

On Extensions of Process Rewrite Systems: Rewrite Systems with Weak Finite-State Unit.
Electr. Notes Theor. Comput. Sci., 2004

Extended Process Rewrite Systems: Expressiveness and Reachability.
Proceedings of the CONCUR 2004 - Concurrency Theory, 15th International Conference, London, UK, August 31, 2004