Compositional Algorithms for Succinct Safety Games

Romain Brenguier
(Université Libre de Bruxelles)
Guillermo A. Pérez
(Université Libre de Bruxelles)
Jean-François Raskin
(Université Libre de Bruxelles)
Ocan Sankur
(Université Libre de Bruxelles)

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.

In Pavol Černý, Viktor Kuncak and Madhusudan Parthasarathy: Proceedings Fourth Workshop on Synthesis (SYNT 2015), San Francisco, CA, USA, 18th July 2015, Electronic Proceedings in Theoretical Computer Science 202, pp. 98–111.
Published: 2nd February 2016.

ArXived at: bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to:
For website issues: