15 citations · 79 across the 28 of their papers we have counts for
40 papers
A Theory of Hanoi Omega-Automata and Games
Emmanuel Filiot, Allen Joseph, Guillermo A. Pérez +1
The Hanoi Omega-Automata (HOA) format has established itself as the definitive standard for encoding -regular automata in modern synthesis tools. While HOA is widely adopted due…
An Automata-Based Approach to Games with -Automatic Preferences
Véronique Bruyère, Emmanuel Filiot, Christophe Grandmont +1
This paper studies multiplayer turn-based games on graphs in which player preferences are modeled as -automatic relations given by deterministic parity automata. This contrasts…
Lexicographic transductions of finite words
Emmanuel Filiot, Pierre-Alain Reynier, Nathan Lhote
Regular transductions over finite words have linear input-to-output growth. This class of transductions enjoys many characterizations. Recently, regular transductions have been ext…
Deterministic regular functions of infinite words
Olivier Carton, Gaëtan Douéneau-Tabot, Emmanuel Filiot +1
Regular functions of infinite words are (partial) functions realized by deterministic two-way transducers with infinite look-ahead. Equivalently, Alur et. al. have shown that they…
LTL Reactive Synthesis with a Few Hints
Mrudula Balachander, Emmanuel Filiot, Jean-François Raskin
We study a variant of the problem of synthesizing Mealy machines that enforce LTL specifications against all possible behaviours of the environment including hostile ones. In the v…
A Generic Solution to Register-bounded Synthesis with an Application to Discrete Orders
Léo Exibard, Emmanuel Filiot, Ayrat Khalimov
We study synthesis of reactive systems interacting with environments using an infinite data domain. A popular formalism for specifying and modelling such systems is register automa…