1 citations · 1 across the 5 of their papers we have counts for
5 papers
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…
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…
Gray-Box Fuzzing via Gradient Descent and Boolean Expression Coverage (Technical Report)
Martin Jonáš, Jan Strejček, Marek Trtík +1
We present a novel gray-box fuzzing algorithm monitoring executions of instructions converting numerical values to Boolean ones. An important class of such instructions evaluate pr…
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…
On the Complexity of the Quantified Bit-Vector Arithmetic with Binary Encoding
Martin Jonáš, Jan Strejček
We study the precise computational complexity of deciding satisfiability of first-order quantified formulas over the theory of fixed-size bit-vectors with binary-encoded bit-widths…