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 条
  • [41] Model checking open systems with alternating projection temporal logic
    Tian, Cong
    Duan, Zhenhua
    THEORETICAL COMPUTER SCIENCE, 2019, 774 : 65 - 81
  • [42] Improving symbolic model checking by rewriting temporal logic formulae
    Déharbe, D
    Moreira, AM
    Ringeissen, C
    REWRITING TECHNIQUES AND APPLICATIONS, 2002, 2378 : 207 - 221
  • [43] A Probabilistic Temporal Logic with Frequency Operators and Its Model Checking
    Tomita, Takashi
    Hagihara, Shigeki
    Yonezaki, Naoki
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2011, (73): : 79 - 93
  • [44] Bounded model checking for branching-time temporal logic
    Zhou Conghua
    Tao Zhihong
    Ding Decheng
    Wang Lifu
    CHINESE JOURNAL OF ELECTRONICS, 2006, 15 (04): : 675 - 678
  • [45] Possibilistic Fuzzy Linear Temporal Logic and Its Model Checking
    Li, Yongming
    Wei, Jielin
    IEEE TRANSACTIONS ON FUZZY SYSTEMS, 2021, 29 (07) : 1899 - 1913
  • [46] Verifying communicating agents by model checking in a temporal action logic
    Giordano, L
    Martelli, A
    Schwind, C
    LOGICS IN ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2004, 3229 : 57 - 69
  • [47] Model checking propositional projection temporal logic based on SPIN
    Tian, Cong
    Duan, Zhenhua
    FORMAL METHODS AND SOFTWARE ENGINEERING, PROCEEDINGS, 2007, 4789 : 246 - 265
  • [48] Parameterised Model Checking for Alternating-Time Temporal Logic
    Kouvaros, Panagiotis
    Lomuscio, Alessio
    ECAI 2016: 22ND EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2016, 285 : 1230 - 1238
  • [49] From Model-Checking to Temporal Logic Constraint Solving
    Fages, Francois
    Rizk, Aurelien
    PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING, 2009, 5732 : 319 - 334
  • [50] Model Checking Temporal Epistemic Logic under Bounded Recall
    Belardinelli, Francesco
    Lomuscio, Alessio
    Yu, Emily
    THIRTY-FOURTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, THE THIRTY-SECOND INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE AND THE TENTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2020, 34 : 7071 - 7078