Slicing Behavior Tree Models for Verification - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2010

Slicing Behavior Tree Models for Verification


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.
Fichier principal
Vignette du fichier
03230126.pdf (173.66 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01054464 , version 1 (06-08-2014)





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⟩
105 View
183 Download



Gmail Facebook Twitter LinkedIn More