Efficient Realizability Checking by Modularization of LTL Specifications-Reference-Cited by-同舟云学术

Efficient Realizability Checking by Modularization of LTL Specifications

Published:2021-09-03 Issue: Volume: Page:
ISSN:0010-4620
Container-title:The Computer Journal
language:en
Short-container-title:

Author:

Ito Sohei¹,Osari Kenji²,Shimakawa Masaya³,Hagihara Shigeki⁴,Yonezaki Naoki⁵

Affiliation:

1. Nagasaki University, School of Information and Data Sciences, Graduate School of Engineering, 1-14 Bunkyomachi, Nagasaki City 852-8521, Japan

2. Mercari, Inc, Roppongi Hills Mori Tower, 6-10-1 Roppongi, Minato-ku, Tokyo 106-6118, Japan

3. Takushoku University, Department of Computer Science, Faculty of Engineering, 815-1 Tatemachi, Hachioji-shi, Tokyo 193-0985, Japan

4. Chitose Institute of Science and Technology, Department of Information Systems Engineering, Faculty of Science and Technology, 758-65 Bibi, Chitose, Hokkaido 066-8655, Japan

5. The Open University of Japan, Tokyo Shibuya learning center, Goto-Ikueikai Building F1, 1-10-7 Dougenzaka, Shibuya-ku, Tokyo 150-0043, Japan

Abstract

Abstract 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.

Funder

JSPS

Publisher

Oxford University Press (OUP)

Subject

General Computer Science

Link

http://academic.oup.com/comjnl/advance-article-pdf/doi/10.1093/comjnl/bxab116/40301065/bxab116.pdf

Reference41 articles.

1. On the synthesis of a reactive module