An optimised algorithm to tackle the model explosion problem in CTL model update

Authors:
Yulin Ding;David Hemer
Affiliations:
Airborne Mission Systems, Defence Science and Technology Organisation, Edinburgh, SA, Australia;School of Computer Science, The University of Adelaide, Australia
Venue:
PRICAI'10 Proceedings of the 11th Pacific Rim international conference on Trends in artificial intelligence
Year:
2010

Citing 4
Cited 0

Enhancing model checking in verification by AI techniques

Artificial Intelligence
Logic in computer science: modelling and reasoning about systems

Logic in computer science: modelling and reasoning about systems
Model checking

Model checking
CTL Model Update: Semantics, Computations and Implementation

Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy

Quantified Score

Hi-index	0.00

Visualization

Abstract

Computational Tree Logic (CTL) model update is an approach to software verification and modification, where minimal change is employed to generate updated models that represent the corrected software design. In this paper, we propose a new update principle named minimal change with maximal reachable states (II) which is a further optimisation of an existing algorithm to solve a model explosion problem during CTL model update. We provide comparison of the two methods based on Graph Theory. The algorithm of this update principle is also provided. Our experimental results show that in the case of updating the Andrew File System protocol model, the new CTL update approach significantly narrows down the committed models to fewer strong committed models.