Slicing Behavior Tree Models for Verification

Loading...
Thumbnail Image
File version
Author(s)
Yatapanage, Nisansala
Winter, Kirsten
Zafar, Saad
Griffith University Author(s)
Primary Supervisor
Other Supervisors
Editor(s)

Christian S.Calude and Vladimiro Sassone

Date
2010
Size

241381 bytes

File type(s)

application/pdf

Location

Brisbane, Australia

License
Abstract

Program slicing is a reduction technique that removes irrelevant parts of a program automatically, based on dependencies. It is used in the context of documentation to improve the user's understanding as well as for reducing the size of a program when analysing. In this paper we describe an approach for slicing not program code but models of software or systems written in the graphical Behavior Tree language. Our focus is to utilise this reduction technique when model checking Behavior Tree models. Model checking as a fully automated analysis technique is restricted in the size of the model and slicing provides one means to improve on the inherent limitations. We present a Health Information System as a case study. The full model of the system could not be verified due to memory limits. However, our slicing algorithm renders the model to a size for which the model checker terminates. The results nicely demonstrate and quantify the benefits of our approach.

Journal Title
Conference Title

Theoretical Computer Science

Book Title
Edition
Volume
Issue
Thesis Type
Degree Program
School
Publisher link
Patent number
Funder(s)
Grant identifier(s)
Rights Statement
Rights Statement

IFIP, 2010. This is the author's version of the work. It is posted here by permission of IFIP for your personal use. Not for redistribution. The definitive version was published in Theoretical Computer Science, IFIP AICT, Vol. 323, (Boston:Springer), pp.125-139.

Item Access Status
Note
Access the data
Related item(s)
Subject

Software Engineering

Information Systems

Persistent link to this record
Citation