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 条
  • [21] Temporal logic and model checking
    McMillan, KL
    VERIFICATION OF DIGITAL AND HYBRID SYSTEM, 2000, 170 : 36 - 54
  • [22] Collapse of the random-phase approximation: Examples and counter-examples from the shell model
    Johnson, Calvin W.
    Stetcu, Ionel
    PHYSICAL REVIEW C, 2009, 80 (02):
  • [23] UTP and Temporal Logic Model Checking
    Anderson, Hugh
    Ciobanu, Gabriel
    Freitas, Leo
    UNIFYING THEORIES OF PROGRAMMING, 2010, 5713 : 22 - +
  • [24] Techniques for temporal logic model checking
    Deharbe, David
    REFINEMENT TECHNIQUES IN SOFTWARE ENGINEERING, 2006, 3167 : 315 - 367
  • [25] Model checking distributed temporal logic
    Dionisio, Francisco
    Ramos, Jaime
    Subtil, Fernando
    Vigano, Luca
    LOGIC JOURNAL OF THE IGPL, 2024,
  • [26] Model checking interval temporal logic
    Zhang, Hai-Bin
    Duan, Zhen-Hua
    Xi'an Dianzi Keji Daxue Xuebao/Journal of Xidian University, 2009, 36 (02): : 338 - 342
  • [27] Symmetry in temporal logic model checking
    Miller, Alice
    Donaldson, Alastair
    Calder, Muffy
    ACM COMPUTING SURVEYS, 2006, 38 (03) : 2
  • [28] Statistical Model Checking for Probabilistic Temporal Epistemic Logics
    Ramesh, Yenda
    Rao, M. V. Panduranga
    ICAART: PROCEEDINGS OF THE 14TH INTERNATIONAL CONFERENCE ON AGENTS AND ARTIFICIAL INTELLIGENCE - VOL 1, 2022, : 53 - 63
  • [29] Model checking for epistemic and temporal properties of uncertain agents
    Cao, Zining
    AGENT COMPUTING AND MULTI-AGENT SYSTEMS, 2006, 4088 : 46 - 58
  • [30] A SAT-based approach to unbounded model checking for Alternating-time Temporal Epistemic Logic
    Kacprzak, M
    Penczek, W
    SYNTHESE, 2004, 142 (02) : 203 - 227