In this paper we study the problem of realizability of reactive specifications written in LTL T,
which is the extension of LTL where atomic propositions can be literals from a first-order …

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 …

We introduce the class of tree constraint automata with data values in Z (equipped with the
less than relation and equality predicates to constants) and we show that the nonemptiness …

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 …

Constraint linear-time temporal logic (CLTL) is an extension of LTL that is interpreted on
sequences of valuations of variables over an infinite domain. Atomic formulas can constrain …

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 …

A reactive system is a system that continuously interacts with its environment. The
environment provides an input signal, to which the system reacts with an output signal, and …

We consider two-player zero-sum games with winning objectives beyond regular
languages, expressed as a parity condition in conjunction with a Boolean combination of …

In the classical setting, the set of signals available to the machine is assumed to be finite.
However, this assumption is not realistic for modelling systems that process data from a …