Publication
Title
Compositional algorithms for succinct safety games
Author
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.
Language
English
Source (journal)
Electronic Proceedings in Theoretical Computer Science
Source (book)
4th Workshop on Synthesis, SYNT 2015, 18th July 2015, San Francisco, CA, USA
Publication
2016
ISSN
2075-2180
Volume/pages
202 (2016) , p. 98-111
ISI
000390259500008
Full text (Publisher's DOI)
Full text (open access)
UAntwerpen
Publication type
Subject
External links
Web of Science
Record
Identification
Creation 16.11.2018
Last edited 29.11.2021