Rich Counter-Examples for Temporal-Epistemic Logic Model Checking

被引:3
|
作者
Busard, Simon [1 ]
Pecheur, Charles [1 ]
机构
[1] Catholic Univ Louvain, ICTEAM Inst, Louvain La Neuve, Belgium
关键词
D O I
10.4204/EPTCS.78.4
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Model checking verifies that a model of a system satisfies a given property, and otherwise produces a counter-example explaining the violation. The verified properties are formally expressed in temporal logics. Some temporal logics, such as CTL, are branching: they allow to express facts about the whole computation tree of the model, rather than on each single linear computation. This branching aspect is even more critical when dealing with multi-modal logics, i.e. logics expressing facts about systems with several transition relations. A prominent example is CTLK, a logic that reasons about temporal and epistemic properties of multi-agent systems. In general, model checkers produce linear counter-examples for failed properties, composed of a single computation path of the model. But some branching properties are only poorly and partially explained by a linear counter-example. This paper proposes richer counter-example structures called tree-like annotated counter-examples (TLACEs), for properties in Action-Restricted CTL (ARCTL), an extension of CTL quantifying paths restricted in terms of actions labeling transitions of the model. These counter-examples have a branching structure that supports more complete description of property violations. Elements of these counter-examples are annotated with parts of the property to give a better understanding of their structure. Visualization and browsing of these richer counter-examples become a critical issue, as the number of branches and states can grow exponentially for deeply-nested properties. This paper formally defines the structure of TLACEs, characterizes adequate counter-examples w.r.t. models and failed properties, and gives a generation algorithm for ARCTL properties. It also illustrates the approach with examples in CTLK, using a reduction of CTLK to ARCTL. The proposed approach has been implemented, first by extending the NuSMV model checker to generate and export branching counter-examples, secondly by providing an interactive graphical interface to visualize and browse them.
引用
收藏
页码:39 / 53
页数:15
相关论文
共 50 条
  • [41] Decidability of model checking with the temporal logic EF
    Mayr, R
    THEORETICAL COMPUTER SCIENCE, 2001, 256 (1-2) : 31 - 62
  • [42] Model Checking over Paraconsistent Temporal Logic
    陈冬火
    王林章
    崔家林
    JournalofDonghuaUniversity(EnglishEdition), 2008, 25 (05) : 571 - 580
  • [43] Coverage metrics for temporal logic model checking
    Chockler, Hana
    Kupferman, Orna
    Vardi, Moshe Y.
    FORMAL METHODS IN SYSTEM DESIGN, 2006, 28 (03) : 189 - 212
  • [44] Using Model Transformation to Generate Graphical Counter-Examples for the Formal Analysis of xUML Models
    dos Santos, Osmar M.
    Woodcock, Jim
    Paige, Richard
    2011 16TH IEEE INTERNATIONAL CONFERENCE ON ENGINEERING OF COMPLEX COMPUTER SYSTEMS (ICECCS), 2011, : 117 - 126
  • [45] Completeness of bounded model checking temporal logic of knowledge
    Liu, Zhifeng
    Ge, Yun
    Zhang, Dong
    Zhou, Conghua
    Journal of Southeast University (English Edition), 2010, 26 (03) : 399 - 405
  • [46] Symbolic Model Checking for Alternating Projection Temporal Logic
    Wang, Haiyang
    Duan, Zhenhua
    Tian, Cong
    COMBINATORIAL OPTIMIZATION AND APPLICATIONS, (COCOA 2015), 2015, 9486 : 481 - 495
  • [47] Model checking for event graphs and event temporal logic
    Xia, Wei
    Yao, Yi-Ping
    Mu, Xiao-Dong
    Ruan Jian Xue Bao/Journal of Software, 2013, 24 (03): : 421 - 432
  • [48] Model checking of pushdown systems for projection temporal logic
    Zhao, Liang
    Wang, Xiaobing
    Duan, Zhenhua
    THEORETICAL COMPUTER SCIENCE, 2019, 774 : 82 - 94
  • [49] Temporal Logic and Model Checking for Operator Precedence Languages
    Chiari, Michele
    Mandrioli, Dino
    Pradella, Matteo
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2018, (277): : 161 - 175
  • [50] Abstraction for Model Checking the Probabilistic Temporal Logic of Knowledge
    Zhou, Conghua
    Sun, Bo
    Liu, Zhifeng
    ARTIFICIAL INTELLIGENCE AND COMPUTATIONAL INTELLIGENCE, PT I, 2010, 6319 : 209 - 221