15 citations · 37 across the 12 of their papers we have counts for
13 papers
Generalised Reachability Games
Sougata Bose, Nathanael Fijalkow, Daniel Hausmann +4
We study two-player zero-sum turn-based games played on graphs with multiple reachability objectives called generalised reachability games. In classic reachability games the goal o…
Playing Safe, Ten Years Later
Thomas Colcombet, Nathanaël Fijalkow, Florian Horn
We consider two-player games over graphs and give tight bounds on the memory size of strategies ensuring safety objectives. More specifically, we show that the minimal number of me…
Deciding the existence of cut-off in parameterized rendez-vous networks
Florian Horn, Arnaud Sangnier
We study networks of processes which all execute the same finite-state protocol and communicate thanks to a rendez-vous mechanism. Given a protocol, we are interested in checking w…
Two Recursively Inseparable Problems for Probabilistic Automata
Nathanaël Fijalkow, Hugo Gimbert, Florian Horn +1
This paper introduces and investigates decision problems for numberless probabilistic automata, i.e. probabilistic automata where the support of each probabilistic transitions is s…
Trading Bounds for Memory in Games with Counters
Nathanaël Fijalkow, Florian Horn, Denis Kuperberg +1
We study two-player games with counters, where the objective of the first player is that the counter values remain bounded. We investigate the existence of a trade-off between the…
Entropy Games and Matrix Multiplication Games
Eugene Asarin, Julien Cervelle, Aldric Degorre +3
Two intimately related new classes of games are introduced and studied: entropy games (EGs) and matrix multiplication games (MMGs). An EG is played on a finite arena by two-and-a-h…