Temporal logic query checking: A tool for model exploration

被引:33
|
作者
Gurfinkel, A [1 ]
Chechik, M [1 ]
Devereux, B [1 ]
机构
[1] Univ Toronto, Dept Comp Sci, Toronto, ON M5S 3G4, Canada
关键词
CTL; query checking; model checking; TLQSolver; model understanding; multi-valued logic;
D O I
10.1109/TSE.2003.1237171
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Temporal logic query checking was first introduced by:W. Chain in order to speed up design understanding by discovering properties not known,a priori. A query is a temporal logic formula containing a special symbol ?(1), known as a placeholder. Given a Kripke, structure and a propositional formula phi, we say that phi satisfies the query if replacing the placeholder by phi results in a temporal logic formula satisfied by the Kripke structure. A solution to a temporal logic query on a Kripke structure is the set of all. propositional formulas that satisfy the query. Query checking helps discover temporal properties of-a system and, as such, is a useful tool for model exploration. In this paper, we show that query checking is applicable to a variety of model exploration tasks, ranging from invariant computation to test case-generation., We illustrate these using a Cruise Control System. Additionally, we show that query checking is an instance of a multi-valued model checking of Chechik et al. This approach enables us to build an implementation of a temporal logic query-checker, TLQSolver on top of our existing multi-valued model checker chiChek. It also allows us to decide a large class of queries and. introduce witnesses for temporal logic queries-an essential notion for effective model exploration.
引用
收藏
页码:898 / 914
页数:17
相关论文
共 50 条
  • [21] Model checking propositional projection temporal logic based on SPIN
    Tian, Cong
    Duan, Zhenhua
    FORMAL METHODS AND SOFTWARE ENGINEERING, PROCEEDINGS, 2007, 4789 : 246 - 265
  • [22] Constraining Cycle Alternations in Model Checking for Interval Temporal Logic
    Molinari, Alberto
    Montanari, Angelo
    Peron, Adriano
    ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2016, 322 (322) : 211 - 226
  • [23] A Foundation for Flow-Based Program Matching Using Temporal Logic and Model Checking
    Brunel, Julien
    Doligez, Damien
    Hansen, Rene Rydhof
    Lawall, Julia L.
    Muller, Gilles
    ACM SIGPLAN NOTICES, 2009, 44 (01) : 114 - 126
  • [24] Which fragments of the interval temporal logic HS are tractable in model checking?
    Bozzelli, Laura
    Molinari, Alberto
    Montanari, Angelo
    Peron, Adriano
    Sala, Pietro
    THEORETICAL COMPUTER SCIENCE, 2019, 764 : 125 - 144
  • [25] Propositional projection temporal logic based distributed model checking method
    Shu X.
    Wang C.
    Wang Y.
    Zhang L.
    Xi'an Dianzi Keji Daxue Xuebao/Journal of Xidian University, 2020, 47 (04): : 39 - 47
  • [26] Satisfiability and Model Checking for One Parameterized Extension of Linear Temporal Logic
    Gnatenko, A. R.
    Zakharov, V. A.
    AUTOMATIC CONTROL AND COMPUTER SCIENCES, 2022, 56 (07) : 649 - 660
  • [27] Abstraction In Model Checking Real-Time Temporal Logic of Knowledge
    Zhou, CongHua
    Sun, Bo
    JOURNAL OF COMPUTERS, 2012, 7 (02) : 362 - 370
  • [28] Efficient SMT-Based Model Checking for Signal Temporal Logic
    Lee, Jia
    Yu, Geunyeol
    Bae, Kyungmin
    2021 36TH IEEE/ACM INTERNATIONAL CONFERENCE ON AUTOMATED SOFTWARE ENGINEERING ASE 2021, 2021, : 343 - 354
  • [29] Satisfiability and Model Checking for One Parameterized Extension of Linear Temporal Logic
    A. R. Gnatenko
    V. A. Zakharov
    Automatic Control and Computer Sciences, 2022, 56 : 649 - 660
  • [30] Intrusion Detection Algorithm Based on Model Checking Interval Temporal Logic
    Zhu Weijun
    Wang Zhongyong
    Zhang Haibin
    CHINA COMMUNICATIONS, 2011, 8 (03) : 66 - 72