首页 /研究 /Mining assumptions for synthesis
OTHER

Mining assumptions for synthesis

Wenchao Li, Lili Dworkin, Sanjit A. Seshia

发表年份
2011
引用次数
102

摘要

Automatic synthesis of a reactive system from its formal specification is appealing but often difficult due to the tedium of writing auxiliary specifications, especially on the environment. In several instances, specifications are found unrealizable as a result of insufficient environmental assumptions. We present an approach to this problem for synthesis from LTL based on specification mining. For a satisfiable but unrealizable specification, a counter-strategy can be computed from the synthesis game as a witness to unrealizability. Our algorithm mines environment assumptions from this counter-strategy as well as user scenarios if they are provided. We argue that our approach is a natural way to discover the designer's intent. We demonstrate the effectiveness of our approach on examples from the domains of digital circuits and robotic controllers.

关键词

Computer scienceWitnessTemporal logicFormal specificationProgramming languageTheoretical computer science

相关论文

查看 OTHER 分类全部论文