George Chatzieleftheriou ; Borzoo Bonakdarpour ; Panagiotis Katsaros ; Scott A. Smolka - Abstract Model Repair

lmcs:1587 - Logical Methods in Computer Science, September 17, 2015, Volume 11, Issue 3 - https://doi.org/10.2168/LMCS-11(3:11)2015
Abstract Model RepairArticle

Authors: George Chatzieleftheriou ; Borzoo Bonakdarpour ; Panagiotis Katsaros ORCID; Scott A. Smolka

    Given a Kripke structure M and CTL formula $\varphi$, where M does not satisfy $\varphi$, the problem of Model Repair is to obtain a new model M' such that M' satisfies $\varphi$. Moreover, the changes made to M to derive M' should be minimum with respect to all such M'. As in model checking, state explosion can make it virtually impossible to carry out model repair on models with infinite or even large state spaces. In this paper, we present a framework for model repair that uses abstraction refinement to tackle state explosion. Our framework aims to repair Kripke Structure models based on a Kripke Modal Transition System abstraction and a 3-valued semantics for CTL. We introduce an abstract-model-repair algorithm for which we prove soundness and semi-completeness, and we study its complexity class. Moreover, a prototype implementation is presented to illustrate the practical utility of abstract-model-repair on an Automatic Door Opener system model and a model of the Andrew File System 1 protocol.


    Volume: Volume 11, Issue 3
    Published on: September 17, 2015
    Submitted on: July 2, 2014
    Keywords: Computer Science - Logic in Computer Science
    Funding:
      Source : OpenAIRE Graph
    • Funder: Natural Sciences and Engineering Research Council of Canada

    4 Documents citing this article

    Consultation statistics

    This page has been seen 1124 times.
    This article's PDF has been downloaded 294 times.