Compositional Algorithms for Succinct Safety Games
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...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Open Publishing Association
2016-02-01
|
| Series: | Electronic Proceedings in Theoretical Computer Science |
| Online Access: | http://arxiv.org/pdf/1602.01174v1 |
| _version_ | 1818547806906875904 |
|---|---|
| author | Romain Brenguier Guillermo A. Pérez Jean-François Raskin Ocan Sankur |
| author_facet | Romain Brenguier Guillermo A. Pérez Jean-François Raskin Ocan Sankur |
| author_sort | Romain Brenguier |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-12-12T08:11:36Z |
| format | Article |
| id | doaj.art-435c1113aa274153a49aeab2d64b1c6c |
| institution | Directory Open Access Journal |
| issn | 2075-2180 |
| language | English |
| last_indexed | 2024-12-12T08:11:36Z |
| publishDate | 2016-02-01 |
| publisher | Open Publishing Association |
| record_format | Article |
| series | Electronic Proceedings in Theoretical Computer Science |
| spelling | doaj.art-435c1113aa274153a49aeab2d64b1c6c2022-12-22T00:31:46ZengOpen Publishing AssociationElectronic Proceedings in Theoretical Computer Science2075-21802016-02-01202Proc. SYNT 20159811110.4204/EPTCS.202.7:3Compositional Algorithms for Succinct Safety GamesRomain Brenguier0Guillermo A. Pérez1Jean-François Raskin2Ocan Sankur3 Université Libre de Bruxelles Université Libre de Bruxelles Université Libre de Bruxelles 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.http://arxiv.org/pdf/1602.01174v1 |
| spellingShingle | Romain Brenguier Guillermo A. Pérez Jean-François Raskin Ocan Sankur Compositional Algorithms for Succinct Safety Games Electronic Proceedings in Theoretical Computer Science |
| title | Compositional Algorithms for Succinct Safety Games |
| title_full | Compositional Algorithms for Succinct Safety Games |
| title_fullStr | Compositional Algorithms for Succinct Safety Games |
| title_full_unstemmed | Compositional Algorithms for Succinct Safety Games |
| title_short | Compositional Algorithms for Succinct Safety Games |
| title_sort | compositional algorithms for succinct safety games |
| url | http://arxiv.org/pdf/1602.01174v1 |
| work_keys_str_mv | AT romainbrenguier compositionalalgorithmsforsuccinctsafetygames AT guillermoaperez compositionalalgorithmsforsuccinctsafetygames AT jeanfrancoisraskin compositionalalgorithmsforsuccinctsafetygames AT ocansankur compositionalalgorithmsforsuccinctsafetygames |