Search

• < Previous
• 1
• Next >

---

Synthesis of Data Word Transducers

Léo Exibard ; Emmanuel Filiot ; Pierre-Alain Reynier.

In reactive synthesis, the goal is to automatically generate an implementation from a specification of the reactive and non-terminating input/output behaviours of a system. Specifications are usually modelled as logical formulae or automata over infinite sequences of signals ($\omega$-words), while&nbsp;[&hellip;]

---

Streamability of nested word transductions

Emmanuel Filiot ; Olivier Gauwin ; Pierre-Alain Reynier ; Frédéric Servais.

We consider the problem of evaluating in streaming (i.e., in a single left-to-right pass) a nested word transduction with a limited amount of memory. A transduction T is said to be height bounded memory (HBM) if it can be evaluated with a memory that depends only on the size of T and on the height&nbsp;[&hellip;]

---

Computability of Data-Word Transductions over Different Data Domains

Léo Exibard ; Emmanuel Filiot ; Nathan Lhote ; 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 defined through Turing machines with infinite inputs which can produce the corresponding infinite outputs in the limit. We&nbsp;[&hellip;]

---

Optimal controller synthesis for timed systems

Damien Busatto-Gaston ; Benjamin Monmege ; Pierre-Alain Reynier.

Weighted timed games are zero-sum games played by two players on a timed automaton equipped with weights, where one player wants to minimise the cumulative weight while reaching a target. Used in a reactive synthesis perspective, this quantitative extension of timed games allows one to measure the&nbsp;[&hellip;]

---