The synthesis of reactive systems from linear temporal logic (LTL) specifications is an important aspect in the design of reliable software and hardware. We present our adaption of the classic automata-theoretic approach to LTL synthesis, implemented in the tool Strix which has won the two last synthesis competitions ( Syntcomp2018 / 2019 ). The presented approach is (1) structured , meaning that the states used in the construction have a semantic structure that is exploited in several ways, it performs a (2) forward exploration such that it often constructs only a small subset of the reachable states, and it is (3) incremental in the sense that it reuses results from previous inconclusive solution attempts. Further, we present and study different guiding heuristics that determine where to expand the on-demand constructed arena. Moreover, we show several techniques for extracting an implementation (Mealy machine or circuit) from the witness of the tree-automaton emptiness check. Lastly, the chosen constructions use a symbolic representation of the transition functions to reduce runtime and memory consumption. We evaluate the proposed techniques on the Syntcomp2019 benchmark set and show in more detail how the proposed techniques compare to the techniques implemented in other leading LTL synthesis tools.

中文翻译：

---

通过平价游戏从 LTL 规范实际合成反应系统

根据线性时序逻辑 (LTL) 规范综合反应系统是设计可靠软件和硬件的一个重要方面。我们介绍了我们对 LTL 综合的经典自动机理论方法的改编，该方法在赢得最后两场综合比赛 (Syntcomp2018 / 2019) 的工具 Strix 中实现。所提出的方法是 (1) 结构化的，这意味着构造中使用的状态具有以多种方式利用的语义结构，它执行 (2) 前向探索，因此它通常仅构造可到达状态的一小部分，并且它是 (3) 增量的，因为它重用了以前不确定的解决方案尝试的结果。此外，我们提出并研究了不同的指导启发式方法，这些启发式方法决定了在何处扩展按需构建的领域。而且，我们展示了几种从树自动机空性检查的见证中提取实现（Mealy 机器或电路）的技术。最后，所选的结构使用转换函数的符号表示来减少运行时间和内存消耗。我们在 Syntcomp2019 基准集上评估了提议的技术，并更详细地展示了提议的技术与其他领先的 LTL 综合工具中实施的技术的比较。