Extracting Environmental Constraints in Reactive System Specifications

被引:1
|
作者
Fukaya, Yuichi [1 ]
Yoshiura, Noriaki [1 ]
机构
[1] Saitama Univ, Dept Informat & Comp Sci, Sakura Ku, Saitama 3388570, Japan
关键词
BUCHI AUTOMATA;
D O I
10.1007/978-3-319-21410-8_51
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Reactive systems ideally never terminate and maintain some interaction with their environment. Temporal logic is one of the methods for formal specification description of reactive systems. For a reactive system specification, we do not always obtain a program that satisfies it because the reactive system program must satisfy the specification no matter how the environment of the reactive system behaves. This problem is known as realizability or feasibility. The complexity of deciding realizability of specifications that are described in linear temporal logic is double or triple exponential time of the length of specifications and realizability decision is impractical. To check reactive system specifications, Strong satisfiability is one of the necessary conditions of realizability of reactive system specifications. If a reactive system specification is not strong satisfiable, it is necessary to revise the specification. This paper proposes the method of revising reactive system specifications that are not strong satisfiable. This method extracts environmental constraints that are included in reactive system specifications.
引用
收藏
页码:671 / 685
页数:15
相关论文
共 50 条
  • [1] Extracting Environmental Constraints to Make Reactive System Specifications Realizable
    Hagihara, Shigeki
    Kitamura, Yusuke
    Shimakawa, Masaya
    Yonezaki, Naoki
    APSEC 09: SIXTEENTH ASIA-PACIFIC SOFTWARE ENGINEERING CONFERENCE, PROCEEDINGS, 2009, : 61 - +
  • [2] Implementing reactive closed-system specifications
    Klapuri, H
    Takala, J
    Saarinen, J
    JOURNAL OF NETWORK AND COMPUTER APPLICATIONS, 2001, 24 (02) : 101 - 123
  • [3] Implementing reactive closed-system specifications
    Klapuri, H. (harrik@cs.tut.fi), 1600, Elsevier (24):
  • [4] A Characterization on Necessary Conditions of Realizability for Reactive System Specifications
    Tomita, Takashi
    Hagihara, Shigeki
    Shimakawa, Masaya
    Yonezaki, Naoki
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2022, E105D (10) : 1665 - 1677
  • [5] Decision procedures for several properties of reactive system specifications
    Yoshiura, N
    SOFTWARE SECURITY - THEORIES AND SYSTEMS, 2004, 3233 : 154 - 173
  • [6] System requirements and formal specifications of hierarchical reactive systems
    Togashi, A
    Lu, XS
    Kanezashi, F
    SEVENTH INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS, PROCEEDINGS, 2000, : 91 - 98
  • [7] Complexity of Strong Satisfiability Problems for Reactive System Specifications
    Shimakawa, Masaya
    Hagihara, Shigeki
    Yonezaki, Naoki
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2013, E96D (10): : 2187 - 2193
  • [9] Finding the causes of unrealizability of reactive system formal specifications
    Yoshiura, N
    PROCEEDINGS OF THE SECOND INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING AND FORMAL METHODS, 2004, : 34 - 43
  • [10] Bounded Strong Satisfiability Checking of Reactive System Specifications
    Shimakawa, Masaya
    Hagihara, Shigeki
    Yonezaki, Naoki
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2014, E97D (07): : 1746 - 1755