简洁安全对策的合成算法
Compositional Algorithms for Succinct Safety Games
摘要:
我们研究了AIG格式中给出的简洁安全规范的电路合成。我们展示了AIG的安全规格可以自动分解成子规格。然后,我们提出了符号合成算法来解决合成问题的子规格开始。我们已经评估了一组基准上的合成算法,包括在2014年由附属于CAV会议的合成研讨会举办的第一次合成比赛中提出的那些。我们表明,大量的基准可以自动分解,并解决了更有效地与本文提出的组合算法。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。