Work

Compositional Algorithms for Succinct Safety Games

Year: 2016

Type: article

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.

Source: Electronic Proceedings in Theoretical Computer Science

DOI: 10.4204/eptcs.202.7

Authors: Romain Brenguier, Guillermo A. Pérez, Jean-François Raskin, Ocan Sankur

Institution: Université Libre de Bruxelles

Language: English

Topic: Formal Methods in Verification

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: diamond

Funders: Fonds De La Recherche Scientifique - FNRS, FP7 Ideas: European Research Council

Award: inVEST: Foundations for a Shift from Verification to Synthesis