Parameterized Synthesis for Fragments of First-Order Logic over Data Words

10/31/2019
by   Béatrice Bérard, et al.
0

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 run so far, with the aim of fulfilling a given specification. The difficulty is that, at the same time, the environment executes actions that the system cannot control. In contrast to the case of fixed, finite alphabets, here we consider the case of parameterized alphabets. An alphabet reflects the number of processes that are static but unknown. The synthesis problem then asks whether there is a finite number of processes for which the system can satisfy the specification. This variant is already undecidable for very limited logics. Therefore, we consider a first-order logic without the order on word positions. We show that even in this restricted case synthesis is undecidable if both the system and the environment have access to all processes. On the other hand, we prove that the problem is decidable if the environment only has access to a bounded number of processes. In that case, there is even a cutoff meaning that it is enough to examine a bounded number of process architectures to solve the synthesis problem.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/10/2023

First order synthesis for data words revisited

We carry on the study of the synthesis problem on data words for fragmen...
research
10/16/2017

Symmetric Synthesis

We study the problem of determining whether a given temporal specificati...
research
08/28/2018

Reactive Synthesis: Branching Logics and Parameterized Systems

Reactive synthesis is an automatic way to translate a human intention ex...
research
09/14/2016

Finite LTL Synthesis is EXPTIME-complete

LTL synthesis -- the construction of a function to satisfy a logical spe...
research
06/14/2019

Gathering with extremely restricted visibility

We consider the classical problem of making mobile processes gather or c...
research
07/03/2023

On the Satisfiability of Local First-Order Logics with Data

We study first-order logic over unordered structures whose elements carr...
research
04/10/2018

Coverability: Realizability Lower Bounds

We introduce the problem of temporal coverability for realizability and ...

Please sign up or login with your details

Forgot password? Click here to reset