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

足够好的合成

Good-Enough Synthesis

Shaull Almagor, Orna Kupferman

摘要:

在经典的综合问题中,我们给出了一个在输入和输出信号集合上的LTL公式,并且我们综合了一个实现的系统T:对于每个输入序列x,系统关联一个输出序列T(x),使得生成的计算x \otimes T(x)满足。在实践中,在所有环境中满足规范的要求往往过于强烈,并且通常会添加对环境的假设。我们引入了一种新的放松这一要求。在足够好的综合(GE-综合)中,只有当系统存在一个令人满意的计算时,系统才被要求产生一个令人满意的计算。形式上,输入序列x是有希望的,如果存在一些输出序列y,使得计算x \otimes y满足n,并且系统GE-实现n,如果它在所有有希望的输入序列上生成满足n的计算。当正确性的概念是多值的(而不是布尔的)时,GE合成特别相关,因此我们寻求最高质量的系统,并且当合成自治系统时,与意想不到的环境相互作用,并且通常只期望尽最大努力。我们研究了布尔和多值环境下的GE-综合。在这两个,我们建议和解决各种定义的GE合成,对应于不同的方式,设计师可能要考虑到灵活性。我们表明,在所有的变体中,GE合成在计算上并不比传统的合成更难,并且可以在现有的工具上实现。我们的算法是基于不确定性和通用自动机的精心组合。我们通过提供满意度信息的监视器来增强GE实现其规范的系统。在多值设置,我们提供了一个最坏的情况下的分析和基于期望的,后者对应于一个随机环境的相互作用。

英文摘要:

In the classical synthesis problem, we are given an LTL formula ψover sets of input and output signals, and we synthesize a system T that realizes ψ: with every input sequences x, the system associates an output sequence T(x) such that the generated computation x \otimes T(x) satisfies ψ. In practice, the requirement to satisfy the specification in all environments is often too strong, and it is common to add assumptions on the environment. We introduce a new type of relaxation on this requirement. In good-enough synthesis (GE-synthesis), the system is required to generate a satisfying computation only if one exists. Formally, an input sequence x is hopeful if there exists some output sequence y such that the computation x \otimes y satisfies ψ, and a system GE-realizes ψif it generates a computation that satisfies ψon all hopeful input sequences. GE-synthesis is particularly relevant when the notion of correctness is multi-valued (rather than Boolean), and thus we seek systems of the highest possible quality, and when synthesizing autonomous systems, which interact with unexpected environments and are often only expected to do their best. We study GE-synthesis in Boolean and multi-valued settings. In both, we suggest and solve various definitions of GE-synthesis, corresponding to different ways a designer may want to take hopefulness into account. We show that in all variants, GE-synthesis is not computationally harder than traditional synthesis, and can be implemented on top of existing tools. Our algorithms are based on careful combinations of nondeterministic and universal automata. We augment systems that GE-realize their specifications by monitors that provide satisfaction information. In the multi-valued setting, we provide both a worst-case analysis and an expectation-based one, the latter corresponding to an interaction with a stochastic environment.

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

↑