no code implementations • 9 Mar 2021 • Emmanuel Filiot, Christof Löding, Sarah Winter
A weighted specification $S$ assigns a rational value (or $-\infty$) to words in $(I\times O)^*$, and we consider three kinds of objectives for synthesis, namely threshold objectives where the system's executions are required to be above some given threshold, best-value and approximate objectives where the system is required to perform as best as it can by providing output symbols that yield the best value and $\varepsilon$-best value respectively w. r. t.
Formal Languages and Automata Theory Computer Science and Game Theory Logic in Computer Science
no code implementations • 18 Jan 2021 • Léo Exibard, Emmanuel Filiot, Nathan Lhote, Pierre-Alain Reynier
Last, we provide characterizations of (uniform) continuity, which allow us to prove that these notions, and thus also (uniform) computability, are decidable.
Formal Languages and Automata Theory Logic in Computer Science
no code implementations • 9 May 2019 • Léo Exibard, Emmanuel Filiot, Pierre-Alain Reynier
In this context, we study specifications and implementations respectively given as automata and transducers extended with a finite set of registers.
Formal Languages and Automata Theory
