Temporal stream logic (TSL) extends LTL with updates and predicates over arbitrary
function terms. This allows for specifying dataintensive systems for which LTL is not …

Reactive synthesis builds a system from a specification given as a temporal logic formula.
Traditionally, reactive synthesis is defined for systems with Boolean input and output …

In this short survey, we present logical formalisms in which reasoning about concrete
domains is embedded in formulae at the atomic level. These include temporal logics with …

Variable automata with arithmetic enable the specification of reactive systems with variables
over an infinite domain of numeric values and whose operation involves arithmetic …

We study the synthesis problem for systems with a parameterized number of processes. As
in the classical case due to Church, the system selects actions depending on the program …

Traditional synthesis algorithms return, given a specification over finite sets of input and
output Boolean variables, a finite-state transducer all whose computations satisfy the …

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 …

A regular data language is a language over an infinite alphabet recognized by a
deterministic register automaton (DRA), as defined by Benedikt, Ley and Puppis. The later …

Register automaton (RA) is an extension of finite automaton by adding registers storing data
values. RA has good properties such as the decidability of the membership and emptiness …

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 …