** Reactive synthesis over infinite data domains. **

This talk presents reactive synthesis problems over infinite data domains. The goal of reactive synthesis is to automatically generate, from a specification of valid executions, a reactive system interacting with its environment, which enforces only valid executions, no matter what its environment does. There is an extensive literature on reactive synthesis from regular specifications, which semantically are regular languages of infinite words over a finite alphabet. This talk intends to give an overview of several extensions of synthesis to the more general setting of infinite alphabets, allowing to model data (e.g. integers), an aspect which is usually ignored by classical reactive synthesis methods.

The presented work is based on a collaboration with Léo Exibard, Ayrat Khalimov and Pierre-Alain Reynier.