3 citations · 5 across the 7 of their papers we have counts for
3 papers · 1 filter
On Computability of Data Word Functions Defined by Transducers
Léo Exibard, Emmanuel Filiot, Pierre-Alain Reynier
In this paper, we investigate the problem of synthesizing computable functions of infinite words over an infinite alphabet (data omega-words). The notion of computability is define…
Monadic Second-Order Logic with Path-Measure Quantifier is Undecidable
Raphaël Berthon, Emmanuel Filiot, Shibashis Guha +5
We prove that the theory of Monadic Second-Order logic (MSO) of the infinite binary tree extended with qualitative path-measure quantifier is undecidable. This quantifier says that…
Synthesis from LTL Specifications with Mean-Payoff Objectives
Aaron Bohy, Véronique Bruyère, Emmanuel Filiot +1
The classical LTL synthesis problem is purely qualitative: the given LTL specification is realized or not by a reactive system. LTL is not expressive enough to formalize the correc…