Compositional Algorithms for Succinct Safety Games

TL;DR

This paper introduces compositional algorithms for synthesizing circuits from succinct safety specifications in AIG format, improving efficiency by automatically decomposing specifications and solving them compositionally.

Contribution

It presents a novel approach to decompose AIG safety specifications and solve the synthesis problem using symbolic compositional algorithms, demonstrating improved performance.

Findings

Many benchmarks can be automatically decomposed.

Compositional algorithms solve benchmarks more efficiently.

Validated on benchmarks from the 2014 synthesis competition.

Abstract

We study the synthesis of circuits for succinct safety specifications given in the AIG format. We show how AIG safety specifications can be decomposed automatically into sub specifications. Then we propose symbolic compositional algorithms to solve the synthesis problem compositionally starting for the sub-specifications. We have evaluated the compositional algorithms on a set of benchmarks including those proposed for the first synthesis competition organised in 2014 by the Synthesis Workshop affiliated to the CAV conference. We show that a large number of benchmarks can be decomposed automatically and solved more efficiently with the compositional algorithms that we propose in this paper.