47 citations · 144 across the 34 of their papers we have counts for
3 papers · 1 filter
Strategy Synthesis for General Deductive Games Based on SAT Solving
Miroslav Klimos, Antonin Kucera
We propose a general framework for modelling and solving deductive games, where one player selects a secret code and the other player strives to discover this code using a minimal…
Minimizing Running Costs in Consumption Systems
Tomáš Brázdil, David Klaška, Antonín Kučera +1
A standard approach to optimizing long-run running costs of discrete systems is based on minimizing the mean-payoff, i.e., the long-run average amount of resources ("energy") consu…
Zero-Reachability in Probabilistic Multi-Counter Automata
Tomáš Brázdil, Stefan Kiefer, Antonín Kučera +2
We study the qualitative and quantitative zero-reachability problem in probabilistic multi-counter systems. We identify the undecidable variants of the problems, and then we concen…