Dependency-based Compositional Synthesis (Full Version)

TL;DR

This paper introduces a novel compositional synthesis method that decomposes complex systems into components with dominant strategies, improving scalability without requiring specification rewriting, supported by semantic and syntactic dependency analysis.

Contribution

It presents a dependency-based decomposition approach for compositional synthesis that ensures soundness and completeness, enabling scalable reactive system synthesis without intervention.

Findings

Algorithm successfully decomposes systems into components with dominant strategies

Semantic and syntactic dependency analysis effectively guides decomposition

Experimental results show improved scalability and practical applicability

Abstract

Despite many recent advances, reactive synthesis is still not really a practical technique. The grand challenge is to scale from small transition systems, where synthesis performs well, to complex multi-component designs. Compositional methods, such as the construction of dominant strategies for individual components, reduce the complexity significantly, but are usually not applicable without extensively rewriting the specification. In this paper, we present a refinement of compositional synthesis that does not require such an intervention. Our algorithm decomposes the system into a sequence of components, such that every component has a strategy that is dominant, i.e., performs at least as good as any possible alternative, provided that the preceding components follow their (already synthesized) strategies. The decomposition of the system is based on a dependency analysis, for which we provide semantic and syntactic techniques. We establish the soundness and completeness of the approach and report on encouraging experimental results.