Falsification-Aware Semantics for Temporal Logics and Their Inconsistency-Tolerant Subsystems: Theoretical Foundations of Falsification-Aware Model Checking

被引:1
作者
Kamide, Norihiro [1 ]
机构
[1] Teikyo Univ, Fac Sci & Engn, Dept Informat & Elect Engn, Toyosatodai 1-1, Utsunomiya, Tochigi 3208551, Japan
关键词
Falsification-aware semantics; computation tree logic; linear-time temporal logic; inconsistency-tolerant temporal logic; falsification-aware model checking; inconsistency-tolerant model checking; ABSTRACTION;
D O I
10.1142/S0218194022500371
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Model checking is well known to be a computer-aided method for verifying concurrent systems. Temporal logics and their Kripke-style semantics have been widely used in model checking. Falsification-aware Kripke-style semantics for temporal logics have been required for the theoretical basis of model checking because falsification plays a critical role in obtaining counter-example traces for the underlying object specifications in model checking. However, a useful falsification-aware Kripke-style semantics has yet to be developed for standard temporal logics. Hence, this study introduces two types of falsification-aware Kripke-style semantics for standard temporal logics that have been typically used in model checking. The equivalences among the proposed falsification-aware and standard Kripke-style semantics for standard temporal logics are proved. Furthermore, some inconsistency-tolerant subsystems of standard temporal logics are semantically obtained from the proposed falsification-aware Kripke-style semantics for standard temporal logics by deleting a characteristic condition on the labeling function of the semantics. The proposed semantic framework for standard and inconsistency-tolerant temporal logics is regarded as a unified framework for generalizing and combining the existing standard, inconsistency-tolerant, and many-valued semantic frameworks. This unified semantic framework is useful for obtaining a theoretical basis for generalized (inconsistency-tolerant) model checking, referred to here as falsification-aware model checking.
引用
收藏
页码:971 / 1017
页数:47
相关论文
共 52 条
  • [1] CONSTRUCTIBLE FALSITY AND INEXACT PREDICATES
    ALMUKDAD, A
    NELSON, D
    [J]. JOURNAL OF SYMBOLIC LOGIC, 1984, 49 (01) : 231 - 233
  • [2] [Anonymous], 1977, Studia Logica, DOI DOI 10.1007/BF02121114
  • [3] [Anonymous], 1993, LECT NOTES ARTIFICAL
  • [4] [Anonymous], 2022, The Stanford Encyclopedia of Philosophy
  • [5] [Anonymous], 2006, SPIN MODEL CHECKER P
  • [6] [Anonymous], 1979, KLASSISCHE NICHTKLAS
  • [7] Aziz A, 1995, LECT NOTES COMPUT SC, V939, P155
  • [8] Belnap Nuel D., 1977, CONT ASPECTS PHILOS, P30, DOI DOI 10.1007/978-3-030-31136-0
  • [9] Beyer Dirk., 2017, HARDWARE SOFTWARE VE, P99
  • [10] Bianco A., 1995, Foundations of Software Technology and Theoretical Computer Science. 15th Conference. Proceedings, P499