2024/04/22 by Julien Grange, Grange, Julien, Mathieu Lehaut +1
Computer Science · #Algorithms and Data Compression #FOS: Computer and information sciences #Logic in Computer Science (cs.LO) #Natural Language Processing Techniques #Network Packet Processing and Optimization
paper · pdf · doi:10.48550/arxiv.2404.14517
openalex publication_date 2024/04/22 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.