arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1401.3588cs.LO
收藏

参数化综合

Parameterized Synthesis

Swen Jacobs, Roderick Bloem

摘要:

我们研究的综合问题的分布式架构的参数数量的有限状态组件。参数化的规格说明在综合设置中自然出现,但到目前为止,还不清楚如何检测可实现性以及如何在参数化设置中执行综合。使用一个经典的结果验证,我们表明,一类规格的索引LTL \X,参数化合成令牌环网络是等效的分布式合成网络组成的一个单一的过程的几个副本。适应一个著名的结果,从分布式综合,我们表明,后者的问题是不可判定的。我们描述了一个半决策过程的参数化合成问题的令牌环,有界合成的基础上。我们扩展的方法参数化合成令牌传递网络与任意拓扑结构,并显示一个简单的案例研究的适用性。最后,我们勾勒出一个通用的框架,参数化综合的基础上截断和其他参数化验证技术。

英文摘要:

We study the synthesis problem for distributed architectures with a parametric number of finite-state components. Parameterized specifications arise naturally in a synthesis setting, but thus far it was unclear how to detect realizability and how to perform synthesis in a parameterized setting. Using a classical result from verification, we show that for a class of specifications in indexed LTL\X, parameterized synthesis in token ring networks is equivalent to distributed synthesis in a network consisting of a few copies of a single process. Adapting a well-known result from distributed synthesis, we show that the latter problem is undecidable. We describe a semi-decision procedure for the parameterized synthesis problem in token rings, based on bounded synthesis. We extend the approach to parameterized synthesis in token-passing networks with arbitrary topologies, and show applicability on a simple case study. Finally, we sketch a general framework for parameterized synthesis based on cutoffs and other parameterized verification techniques.

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

↑