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 条
  • [1] Symbolic model checking for temporal-epistemic logic
    Lomuscio, Alessio
    Penczek, Wojciech
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2012, 7360 LNCS : 172 - 195
  • [2] A Symmetry Reduction Technique for Model Checking Temporal-Epistemic Logic
    Cohen, Mika
    Dam, Mads
    Lomuscio, Alessio
    Qu, Hongyang
    21ST INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI-09), PROCEEDINGS, 2009, : 721 - 726
  • [3] Undecidable Cases of Model Checking Probabilistic Temporal-Epistemic Logic
    Van Der Meyden, Ron
    Patra, Manas K.
    ACM TRANSACTIONS ON COMPUTATIONAL LOGIC, 2020, 21 (04)
  • [4] Undecidable Cases of Model Checking Probabilistic Temporal-Epistemic Logic
    van der Meyden, Ron
    Patra, Manas K.
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2016, (215): : 264 - 282
  • [5] Model Checking Temporal-Epistemic Logic Using Alternating Tree Automata
    Belardinelli, Francesco
    Jones, Andrew V.
    Lomuscio, Alessio
    FUNDAMENTA INFORMATICAE, 2011, 112 (01) : 19 - 37
  • [6] Model Checking Distributed Systems against Temporal-Epistemic Specifications
    Griesmayer, Andreas
    Lomuscio, Alessio
    FORMAL TECHNIQUES FOR DISTRIBUTED SYSTEMS, FMOODS/FORTE 2013, 2013, 7892 : 130 - 145
  • [7] Parallel Model Checking for Temporal Epistemic Logic
    Kwiatkowska, Marta
    Lomuscio, Alessio
    Qu, Hongyang
    ECAI 2010 - 19TH EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2010, 215 : 543 - 548
  • [8] A Data Symmetry Reduction Technique for Temporal-epistemic Logic
    Cohen, Mika
    Dam, Mads
    Lomuscio, Alessio
    Qi, Hongyang
    AUTOMATED TECHNOLOGY FOR VERIFICATION AND ANALYSIS, PROCEEDINGS, 2009, 5799 : 69 - 83
  • [9] A Lazy Approach to Temporal Epistemic Logic Model Checking
    Cimatti, Alessandro
    Gario, Marco
    Tonetta, Stefano
    AAMAS'16: PROCEEDINGS OF THE 2016 INTERNATIONAL CONFERENCE ON AUTONOMOUS AGENTS & MULTIAGENT SYSTEMS, 2016, : 1218 - 1226
  • [10] Checking Multi-Agent Systems against Temporal-Epistemic Specifications
    Chen, Ran
    Zhang, Wenhui
    2019 24TH INTERNATIONAL CONFERENCE ON ENGINEERING OF COMPLEX COMPUTER SYSTEMS (ICECCS 2019), 2019, : 21 - 30