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 and transducers. They extend finite-state automata by adding registers to store data values and to compare the incoming data values against stored ones. Synthesis from nondeterministic or universal register automata is undecidable in general. However, its register-bounded variant, where additionally a bound on the number of registers in a sought transducer is given, is known to be decidable for universal register automata which can compare data for equality, i.e., for data domain (N,=). This paper extends the decidability border to the domain (N,<) of natural n...
In this paper we work over linearly ordered data domains equipped with finitely many unary predicate...
In this paper, we investigate the problem of synthesizing computable functions of infinite words ove...
International audienceA generic register automaton is a finite automaton equipped with variables (wh...
Traditional synthesis algorithms return, given a specification over finite sets of input and output ...
A reactive system is a system that continuously interacts with its environment. The environment prov...
In reactive synthesis, the goal is to automatically generate an implementation from a specification ...
In reactive synthesis, the goal is to automatically generate an implementation from a specification ...
In reactive synthesis, the goal is to automatically generate an implementation from a specification ...
In reactive synthesis, the goal is to automatically generate an implementation from a specification ...
International audienceIn reactive synthesis, the goal is to automatically generate an implementation...
International audienceIn reactive synthesis, the goal is to automatically generate an implementation...
Register automata are finite automata equipped with a finite set of registers in which they can stor...
International audienceRegister automata are finite automata equipped with a finite set of registers ...
We carry on the study of the synthesis problem on data words for fragments of first order logic, and...
We carry on the study of the synthesis problem on data words for fragments of first order logic, and...
In this paper we work over linearly ordered data domains equipped with finitely many unary predicate...
In this paper, we investigate the problem of synthesizing computable functions of infinite words ove...
International audienceA generic register automaton is a finite automaton equipped with variables (wh...
Traditional synthesis algorithms return, given a specification over finite sets of input and output ...
A reactive system is a system that continuously interacts with its environment. The environment prov...
In reactive synthesis, the goal is to automatically generate an implementation from a specification ...
In reactive synthesis, the goal is to automatically generate an implementation from a specification ...
In reactive synthesis, the goal is to automatically generate an implementation from a specification ...
In reactive synthesis, the goal is to automatically generate an implementation from a specification ...
International audienceIn reactive synthesis, the goal is to automatically generate an implementation...
International audienceIn reactive synthesis, the goal is to automatically generate an implementation...
Register automata are finite automata equipped with a finite set of registers in which they can stor...
International audienceRegister automata are finite automata equipped with a finite set of registers ...
We carry on the study of the synthesis problem on data words for fragments of first order logic, and...
We carry on the study of the synthesis problem on data words for fragments of first order logic, and...
In this paper we work over linearly ordered data domains equipped with finitely many unary predicate...
In this paper, we investigate the problem of synthesizing computable functions of infinite words ove...
International audienceA generic register automaton is a finite automaton equipped with variables (wh...