Synthesis for Prefix First-Order Logic on Data Words - Archive ouverte HAL
Communication Dans Un Congrès Année : 2024

Synthesis for Prefix First-Order Logic on Data Words

Résumé

We study the reactive synthesis problem for distributed systems with an unbounded number of participants interacting with an uncontrollable environment. Executions of those systems are modeled by data words, and specifications are given as first-order logic formulas from a fragment we call prefix first-order logic that implements a limited kind of order. We show that this logic has nice properties that enable us to prove decidability of the synthesis problem.

Dates et versions

hal-04708840 , version 1 (25-09-2024)

Identifiants

Citer

Julien Grange, Mathieu Lehaut. Synthesis for Prefix First-Order Logic on Data Words. FORTE 2024, Jun 2024, Groningen, Netherlands. pp.82-98, ⟨10.1007/978-3-031-62645-6_5⟩. ⟨hal-04708840⟩

Collections

LACL UPEC
0 Consultations
0 Téléchargements

Altmetric

Partager

More