Skip to Main content Skip to Navigation
Conference papers

Slicing Behavior Tree Models for Verification

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.
Document type :
Conference papers
Complete list of metadata

Cited literature [30 references]  Display  Hide  Download

https://hal.inria.fr/hal-01054464
Contributor : Hal Ifip <>
Submitted on : Wednesday, August 6, 2014 - 4:26:17 PM
Last modification on : Monday, August 24, 2020 - 2:06:04 PM
Long-term archiving on: : Wednesday, November 26, 2014 - 1:01:46 AM

File

03230126.pdf
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Nisansala Yatapanage, Kirsten Winter, Saad Zafar. Slicing Behavior Tree Models for Verification. 6th IFIP TC 1/WG 2.2 International Conference on Theoretical Computer Science (TCS) / Held as Part of World Computer Congress (WCC), Sep 2010, Brisbane, Australia. pp.125-139, ⟨10.1007/978-3-642-15240-5_10⟩. ⟨hal-01054464⟩

Share

Metrics

Record views

265

Files downloads

566