47 citations · 144 across the 34 of their papers we have counts for
Showing 2021Show all
3 papers · 1 filter
cs.GT2021★ 3 cited
Regstar: Efficient Strategy Synthesis for Adversarial Patrolling Games
David Klaška, Antonín Kučera, Vít Musil +1
We design a new efficient strategy synthesis method applicable to adversarial patrolling problems on graphs with arbitrary-length edges and possibly imperfect intrusion detection.…
cs.LO2021
The Satisfiability Problem for a Quantitative Fragment of PCTL
Miroslav Chodil, Antonín Kučera
We give a sufficient condition under which every finite-satisfiable formula of a given PCTL fragment has a model with at most doubly exponential number of states (consequently, the…
cs.LO2021
Deciding Polynomial Termination Complexity for VASS Programs
Michal Ajdarów, Antonín Kučera
We show that for every fixed , the problem whether the termination/counter complexity of a given demonic VASS is , , and is coNP-com…