VŘVojtěch Řehák

Vojtěch Řehák

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Vojtěch Řehák has a total of 36 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Who Let the Guards Out: Visual Support for Patrolling Games

    by Matěj Lang, Adam Štěpánek, Róbert Zvara, Vojtěch Řehák, Barbora Kozlíková

    Effective security patrol management is critical for ensuring safety in diverse environments such as art galleries, airports, and factories. The behavior of patrols in these situations can be modeled by patrolling games. They simulate the behavior of the patrol and adversary in the building, which is modeled as a graph of interconnected nodes representing rooms. The designers of algorithms solving the game face the problem of analyzing complex graph layouts with temporal dependencies. Therefore, appropriate visual support is crucial for them to work effectively. In this paper, we present a novel tool that helps the designers of patrolling games explore the outcomes of the proposed algorithms and approaches, evaluate their success rate, and propose modifications that can improve their solutions. Our tool offers an intuitive and interactive interface, featuring a detailed exploration of patrol routes and probabilities of taking them, simulation of patrols, and other requested features. In close collaboration with experts in designing patrolling games, we conducted three case studies demonstrating the usage and usefulness of our tool. The prototype of the tool, along with exemplary datasets, is available at https://gitlab.fi.muni.cz/formela/strategy-vizualizer.

  • Open Access

    Who Let the Guards Out: Visual Support for Patrolling Games

    by Matěj Lang, Adam Štěpánek, Róbert Zvara, Vojtěch Řehák, Barbora Kozlíková

    Effective security patrol management is critical for ensuring safety in diverse environments such as art galleries, airports, and factories. The behavior of patrols in these situations can be modeled by patrolling games. They simulate the behavior of the patrol and adversary in the building, which is modeled as a graph of interconnected nodes representing rooms. The designers of algorithms solving the game face the problem of analyzing complex graph layouts with temporal dependencies. Therefore, appropriate visual support is crucial for them to work effectively. In this paper, we present a novel tool that helps the designers of patrolling games explore the outcomes of the proposed algorithms and approaches, evaluate their success rate, and propose modifications that can improve their solutions. Our tool offers an intuitive and interactive interface, featuring a detailed exploration of patrol routes and probabilities of taking them, simulation of patrols, and other requested features. In close collaboration with experts in designing patrolling games, we conducted three case studies demonstrating the usage and usefulness of our tool. The prototype of the tool, along with exemplary datasets, is available at https://gitlab.fi.muni.cz/formela/strategy-vizualizer.

  • Open Access

    Optimizing Local Satisfaction of Long-Run Average Objectives in Markov Decision Processes

    by David Klaška, Antonín Kučera, Vojtěch Kůr, Vít Musil, Vojtěch Řehák

    Long-run average optimization problems for Markov decision processes (MDPs) require constructing policies with optimal steady-state behavior, i.e., optimal limit frequency of visits to the states. However, such policies may suffer from local instability in the sense that the frequency of states visited in a bounded time horizon along a run differs significantly from the limit frequency. In this work, we propose an efficient algorithmic solution to this problem.

  • Open Access

    Optimizing Local Satisfaction of Long-Run Average Objectives in Markov Decision Processes

    by David Klaška, Antonín Kučera, Vojtěch Kůr, Vít Musil, Vojtěch Řehák

    Long-run average optimization problems for Markov decision processes (MDPs) require constructing policies with optimal steady-state behavior, i.e., optimal limit frequency of visits to the states. However, such policies may suffer from local instability, i.e., the frequency of states visited in a bounded time horizon along a run differs significantly from the limit frequency. In this work, we propose an efficient algorithmic solution to this problem.

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

    by Milan Patnaik, V. Kamakoti, Vashek Matyas, Vojtech Rehak

    Malicious users can exploit vulnerabilities in Cognitive Radio Networks (CRNs) and cause heavy performance degradation by Denial of Service (DoS) attacks. During operation, Cognitive Radios (CRs) spend a considerable amount of time to identify idle (free) channels for transmission. In addition, CRs also need additional security mechanisms to prevent malicious attacks. Proactive Model Predictive Control (MPC) based medium access control (MAC) protocols for CRs can quicken the idle channel identification by predicting future states of channels in advance. This provides enough time for CRs to carry out other calculations like DoS attack detection. However, such external detection techniques use additional power that makes them inappropriate for energy constrained applications. As a solution, this paper proposes a proactive learning based MAC protocol (PROLEMus) that shows immunity to two prominent CR based DoS attacks, namely Primary User Emulation Attack (PUEA) and Spectrum Sensing Data Falsification (SSDF) attack, without any external detection mechanism. PROLEMus shows an average of 6.2%, 8.9% and 12.4% improvement in channel utilization, backoff rate and sensing delay, respectively, with low prediction errors (≤ 1.8%) saving 19.65% energy, when compared to recently proposed MAC protocols like ProMAC aided with additional DoS attack detection mechanism.


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

    by Lubos Korenciak, Antonin Kucera, Vojtech Rehak

    We consider the fixed-delay synthesis problem for continuous-time Markov chains extended with fixed-delay transitions (fdCTMC). The goal is to synthesize concrete values of the fixed-delays (timeouts) that minimize the expected total cost incurred before reaching a given set of target states. The same problem has been considered and solved in previous works by computing an optimal policy in a certain discrete-time Markov decision process (MDP) with a huge number of actions that correspond to suitably discretized values of the timeouts. In this paper, we design a symbolic fixed-delay synthesis algorithm which avoids the explicit construction of large action spaces. Instead, the algorithm computes a small sets of "promising" candidate actions on demand. The candidate actions are selected by minimizing a certain objective function by computing its symbolic derivative and extracting a univariate polynomial whose roots are precisely the points where the derivative takes zero value. Since roots of high degree univariate polynomials can be isolated very efficiently using modern mathematical software, we achieve not only drastic memory savings but also speedup by three orders of magnitude compared to the previous methods.


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

    by Tomáš Brázdil, Ľuboš Korenčiak, Jan Krčál, Petr Novotný, Vojtěch Řehák


  • Dealing with Zero Density Using Piecewise Phase-Type Approximation

    by L’uboš Korenčiak, Jan Krčál, Vojtěch Řehák


  • Open Access

    On time-average limits in deterministic and stochastic petri nets

    by Tomáš Brázdil, Luboš Korenčiak, Jan Krčál, Jan Křetínský, Vojtěch Řehák

    In this poster paper, we study performance of systems modeled by deterministic and stochastic Petri nets (DSPN). As a performance measure, we consider long-run average time spent in a set of markings. Even though this measure often appears in DSPN literature, its existence has never been considered. We provide a DSPN model of a simple communication protocol in which the long-run average time spent in a fixed marking is not well-defined due to a highly unstable behavior of the model. Further, we introduce a syntactical restriction on DSPN which preserves most of the modeling power yet guarantees existence of the long-run average.