arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2103.00297cs.SE
收藏

无功系统规范的不可实现核心

Unrealizable Cores for Reactive Systems Specifications

Shahar Maoz, Rafi Shalom

摘要:

反应合成是一种自动化的过程,以获得正确的结构反应体系,其主要挑战之一是处理不可实现的规格。在GR(1)的上下文中,处理不可实现性的一种方法是计算不可实现的核心,这可以被视为一种故障定位方法,GR(1)是LTL的一个表达性的假设保证片段,可以实现有效的合成。然而,现有的解决方案在计算上是昂贵的,仅限于计算单个核心,并且不能正确地支持具有超越纯GR(1)元素的构造的规范。在这项工作中,我们解决这些限制。首先,我们提出了QuickCore,一种新的算法,它通过依赖于不可实现性的单调性,增量计算和GR(1)规范的附加属性来加速不可实现的核心计算。其次,我们提出了打孔,一种新的算法,有效地计算所有无法实现的核心的规范。最后,我们提出了正确处理规范的方法,这些规范包括纯GR(1)元素之外的更高级别的构造。我们在Spectra之上实现了我们的想法,Spectra是一个开放的源语言和合成环境。我们对文献中的基准测试的评估表明,QuickCore在大多数情况下比以前的算法更快,并且其相对优势随着规模的增长而增长。此外,我们发现大多数规范都包含多个核心,而Punch找到所有核心的速度明显快于竞争对手的朴素算法。

英文摘要:

One of the main challenges of reactive synthesis, an automated procedure to obtain a correct-by-construction reactive system, is to deal with unrealizable specifications. One means to deal with unrealizability, in the context of GR(1), an expressive assume-guarantee fragment of LTL that enables efficient synthesis, is the computation of an unrealizable core, which can be viewed as a fault-localization approach. Existing solutions, however, are computationally costly, are limited to computing a single core, and do not correctly support specifications with constructs beyond pure GR(1) elements. In this work we address these limitations. First, we present QuickCore, a novel algorithm that accelerates unrealizable core computations by relying on the monotonicity of unrealizability, on an incremental computation, and on additional properties of GR(1) specifications. Second, we present Punch, a novel algorithm to efficiently compute all unrealizable cores of a specification. Finally, we present means to correctly handle specifications that include higher-level constructs beyond pure GR(1) elements. We implemented our ideas on top of Spectra, an open-source language and synthesis environment. Our evaluation over benchmarks from the literature shows that QuickCore is in most cases faster than previous algorithms, and that its relative advantage grows with scale. Moreover, we found that most specifications include more than one core, and that Punch finds all the cores significantly faster than a competing naive algorithm.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑