Abstract

Reactive synthesis is an automated procedure to obtain a correct-by-construction reactive system from its temporal logic specification. GR(1) is an expressive assume-guarantee fragment of LTL that enables efficient synthesis and has been recently used in different contexts and application domains. A common form of providing system's requirements is through use cases, which are existential in nature. However, GR(1), as a fragment of LTL, is limited to universal properties. In this paper we introduce GR(1)*, which extends GR(1) with existential guarantees. We show that GR(1)* is strictly more expressive than GR(1) as it enables the expression of guarantees that are inexpressible in LTL. We solve the realizability problem for GR(1)* and present a symbolic strategy construction algorithm for GR(1)* specifications. Importantly, in comparison to GR(1), GR(1)* remains efficient: the time complexity of our realizability checking and synthesis procedures for GR(1)* is identical to the time complexity of the known corresponding procedures for GR(1).

中文翻译：

---

GR(1)*：GR(1) 规范扩展了存在保证

摘要

反应式综合是一种自动化程序，可从其时间逻辑规范中获得构造正确的反应式系统。GR(1) 是 LTL 的一个富有表现力的假设保证片段，它可以实现高效的综合，并且最近已在不同的上下文和应用领域中使用。提供系统需求的一种常见形式是通过用例，这些用例本质上是存在的。然而，GR(1) 作为 LTL 的一个片段，仅限于通用属性。在本文中，我们介绍了 GR(1)*，它通过存在保证扩展了 GR(1)。我们证明 GR(1)* 比 GR(1) 更具有表达性，因为它能够表达 LTL 中无法表达的保证。我们解决了 GR(1)* 的可实现性问题，并提出了 GR(1)* 规范的符号策略构造算法。重要的，