3 papers
cs.MA2026
Multiagent Stochastic Shortest Path Problem
Martin Jonáš, Antonín Kučera, Vojtěch Kůr +2
We introduce and study the multi-agent stochastic shortest path (MSSP) problem, in which agents strive to reach a target state, aiming to minimize the expected time to reach th…
cs.MA2025
Steady-State Strategy Synthesis for Swarms of Autonomous Agents
Martin Jonáš, Antonín Kučera, Vojtěch Kůr +1
Steady-state synthesis aims to construct a policy for a given MDP such that the long-run average frequencies of visits to the vertices of satisfy given numerical constraint…
cs.PL2017
SMT Queries Decomposition and Caching in Semi-Symbolic Model Checking
Jan Mrázek, Martin Jonáš, Jiří Barnat
In semi-symbolic (control-explicit data-symbolic) model checking the state-space explosion problem is fought by representing sets of states by first-order formulas over the bit-vec…