Specification Decomposition for Reactive Synthesis

Abstract

Reactive synthesis is the task of automatically deriving an implementation from a specification. It is a promising technique for the development of verified programs and hardware. Despite recent advances, reactive synthesis is still not practical when the specified systems reach a certain bound in size and complexity. In this paper, we present a modular synthesis algorithm that decomposes the specification into smaller subspecifications. For them, independent synthesis tasks are performed, and the composition of the resulting implementations is guaranteed to satisfy the full specification. Our algorithm is a preprocessing technique that can be applied to a wide range of synthesis tools. We evaluate our approach with state-of-the-art synthesis tools on established benchmarks and obtain encouraging results: The overall runtime decreases significantly when synthesizing implementations modularly.

The Reactive Synthesis Competition (SYNTCOMP): 2018-2021

“…• A decomposition of the input specification when possible (Finkbeiner et al, 2021). • An LTL translation to Deterministic Emerson-Lei Automata (DELA) that handles various simplifications: splitting the input formula in a manner similar to the delag tool (Müller and Sickert, 2017), detecting obligation subformulas (Esparza et al, 2018), relying on weak automata and suspendable properties (Babiak et al, 2013).…”

Improvements to ltlsynt

“…. ∧ of subformulas with disjoint output variables, then a strategy for each can be computed separately, as suggested by Finkbeiner et al [8]. Unlike in their experiments, we recompose the different strategies during the AIGER encoding, in case they may share gates.…”

Compositional Synthesis of Modular Systems (Full Version)

“…Computing specification decompositions is not the main focus of this paper; in fact, our algorithm can be used with any decomposition that fulfills the above requirement. There is work on obtaining small subspecifications, e.g., [11], we, however, use an easy decomposition algorithm in the remainder of this paper for simplicity:…”

“…Otherwise, the overhead of synthesizing additional guarantees is small. Related Work: There are several approaches to compositional synthesis for monolithic systems [17,10,16,12,11]. As we are considering distributed systems, we focus on distributed synthesis algorithms.…”