3 papers
cs.MA2024
On the Limits of Information Spread by Memory-less Agents
Niccolò D'Archivio, Robin Vacus
We address the self-stabilizing bit-dissemination problem, designed to capture the challenges of spreading information and reaching consensus among entities with minimal cognitive…
cs.FL2024
Efficient Analysis of Unambiguous Automata Using Matrix Semigroup Techniques
Stefan Kiefer, Cas Widdershoven
We introduce a novel technique to analyse unambiguous Büchi automata quantitatively, and apply this to the model checking problem. It is based on linear-algebra arguments that ori…
cs.GT2024
Strategy Complexity of Reachability in Countable Stochastic 2-Player Games
Stefan Kiefer, Richard Mayr, Mahsa Shirmohammadi +1
We study countably infinite stochastic 2-player games with reachability objectives. Our results provide a complete picture of the memory requirements of -optimal (resp…