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 |