Rich Counter-Examples for Temporal-Epistemic Logic Model Checking

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 w...

Full description

Bibliographic Details
Main Authors: Simon Busard, Charles Pecheur
Format: Article
Language:English
Published: Open Publishing Association 2012-02-01
Series:Electronic Proceedings in Theoretical Computer Science
Online Access:http://arxiv.org/pdf/1202.4509v1
id doaj-87523b6d856d4cbbb6f86f09c3957a99
record_format Article
spelling doaj-87523b6d856d4cbbb6f86f09c3957a992020-11-24T23:48:15ZengOpen Publishing AssociationElectronic Proceedings in Theoretical Computer Science2075-21802012-02-0178Proc. IWIGP 2012395310.4204/EPTCS.78.4Rich Counter-Examples for Temporal-Epistemic Logic Model CheckingSimon BusardCharles PecheurModel 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.http://arxiv.org/pdf/1202.4509v1
collection DOAJ
language English
format Article
sources DOAJ
author Simon Busard
Charles Pecheur
spellingShingle Simon Busard
Charles Pecheur
Rich Counter-Examples for Temporal-Epistemic Logic Model Checking
Electronic Proceedings in Theoretical Computer Science
author_facet Simon Busard
Charles Pecheur
author_sort Simon Busard
title Rich Counter-Examples for Temporal-Epistemic Logic Model Checking
title_short Rich Counter-Examples for Temporal-Epistemic Logic Model Checking
title_full Rich Counter-Examples for Temporal-Epistemic Logic Model Checking
title_fullStr Rich Counter-Examples for Temporal-Epistemic Logic Model Checking
title_full_unstemmed Rich Counter-Examples for Temporal-Epistemic Logic Model Checking
title_sort rich counter-examples for temporal-epistemic logic model checking
publisher Open Publishing Association
series Electronic Proceedings in Theoretical Computer Science
issn 2075-2180
publishDate 2012-02-01
description 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.
url http://arxiv.org/pdf/1202.4509v1
work_keys_str_mv AT simonbusard richcounterexamplesfortemporalepistemiclogicmodelchecking
AT charlespecheur richcounterexamplesfortemporalepistemiclogicmodelchecking
_version_ 1725486452658143232