1 citations · 1 across the 7 of their papers we have counts for
Showing 2023Show all
3 papers · 1 filter
cs.LO2023
First order synthesis for data words revisited
Julien Grange, Mathieu Lehaut
We carry on the study of the synthesis problem on data words for fragments of first order logic, and delineate precisely the border between decidability and undecidability.
cs.FL2023
Symbolic Solution of Emerson-Lei Games for Reactive Synthesis
Daniel Hausmann, Mathieu Lehaut, Nir Pitermann
Emerson-Lei conditions have recently attracted attention due to their succinctness and compositionality properties. In the current work, we show how infinite-duration games with Em…
cs.FL2023
Adding Reconfiguration to Zielonka's Asynchronous Automata
Mathieu Lehaut, Nir Piterman
We study an extension of Zielonka's (fixed) asynchronous automata called reconfigurable asynchronous automata where processes can dynamically change who they communicate with. We s…