Church synthesis on register automata over linearly ordered data domains
In a Church synthesis game, two players, Adam and Eve, alternately pick some element in a
finite alphabet, for an infinite number of rounds. The game is won by Eve if the ω-word …
finite alphabet, for an infinite number of rounds. The game is won by Eve if the ω-word …
A generic solution to register-bounded synthesis with an application to discrete orders
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 automata …
domain. A popular formalism for specifying and modelling such systems is register automata …
Computability of Data-Word Transductions over Different Data Domains
In this paper, we investigate the problem of synthesizing computable functions of infinite
words over an infinite alphabet (data ω-words). The notion of computability is defined …
words over an infinite alphabet (data ω-words). The notion of computability is defined …
[PDF][PDF] M2 Internship Proposal: Parameterized Synthesis via Data Word Automata, Logics and Games
E Filiot, PA Reynier - pageperso.lis-lab.fr
Main objective The main objective of this project is to establish mathematical foundations for
a theory of parameterized synthesis based on the data word abstraction. In particular, the …
a theory of parameterized synthesis based on the data word abstraction. In particular, the …