%0 Conference Proceedings
%T Slicing Behavior Tree Models for Verification
%+ Institute for Integrated and Intelligent Systems
%+ School of Information Technology and Electrical Engineering
%+ Riphah International University
%A Yatapanage, Nisansala
%A Winter, Kirsten
%A Zafar, Saad
%< avec comité de lecture
%( IFIP Advances in Information and Communication Technology
%B 6th IFIP TC 1/WG 2.2 International Conference on Theoretical Computer Science (TCS) / Held as Part of World Computer Congress (WCC)
%C Brisbane, Australia
%Y Cristian S. Calude; Vladimiro Sassone
%I Springer
%3 Theoretical Computer Science
%V AICT-323
%P 125-139
%8 2010-09-20
%D 2010
%R 10.1007/978-3-642-15240-5_10
%Z Computer Science [cs]/Digital Libraries [cs.DL]Conference papers
%X 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.
%G English
%2 https://inria.hal.science/hal-01054464/document
%2 https://inria.hal.science/hal-01054464/file/03230126.pdf
%L hal-01054464
%U https://inria.hal.science/hal-01054464
%~ IFIP
%~ IFIP-AICT
%~ IFIP-AICT-323
%~ IFIP-TC
%~ IFIP-TC1
%~ IFIP-TC2
%~ IFIP-TCS
%~ IFIP-WG2-2
%~ IFIP-WCC
%~ IFIP-2010