当前位置: X-MOL 学术Comput. J. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Efficient Realizability Checking by Modularization of LTL Specifications
The Computer Journal ( IF 1.5 ) Pub Date : 2021-08-05 , DOI: 10.1093/comjnl/bxab116
Sohei Ito 1 , Kenji Osari 2 , Masaya Shimakawa 3 , Shigeki Hagihara 4 , Naoki Yonezaki 5
Affiliation  

Realizability is an important requirement for reactive system specifications. A reactive system interacts with an environment and responds to input events. Realizability ensures the reactive system behaves as specified, no matter how its environment provides input. Typically, reactive system specifications are given using linear temporal logic (LTL), and they can be tested to ascertain whether the specification is realizable. However, the LTL specification realizability problem is 2EXPTIME-complete, which hinders its application to large-scale systems. In this article, we present a modularization method to mitigate this computational challenge.

中文翻译:

通过 LTL 规范的模块化进行高效的可实现性检查

可实现性是反应式系统规范的重要要求。反应式系统与环境交互并响应输入事件。可实现性确保反应系统按照指定的方式运行,无论其环境如何提供输入。通常,反应式系统规范是使用线性时序逻辑 (LTL) 给出的,并且可以对其进行测试以确定规范是否可以实现。然而,LTL 规范的可实现性问题是 2EXPTIME 完备的,这阻碍了其在大规模系统中的应用。在本文中,我们提出了一种模块化方法来缓解这一计算挑战。
更新日期:2021-08-05
down
wechat
bug