Slicing Behavior Tree Models for Verification

  • Nisansala Yatapanage
  • Kirsten Winter
  • Saad Zafar
Conference paper

DOI: 10.1007/978-3-642-15240-5_10

Part of the IFIP Advances in Information and Communication Technology book series (IFIPAICT, volume 323)
Cite this paper as:
Yatapanage N., Winter K., Zafar S. (2010) Slicing Behavior Tree Models for Verification. In: Calude C.S., Sassone V. (eds) Theoretical Computer Science. TCS 2010. IFIP Advances in Information and Communication Technology, vol 323. Springer, Berlin, Heidelberg


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.

Download to read the full conference paper text

Copyright information

© IFIP 2010

Authors and Affiliations

  • Nisansala Yatapanage
    • 1
  • Kirsten Winter
    • 2
  • Saad Zafar
    • 3
  1. 1.Institute for Integrated and Intelligent SystemsGriffith UniversityNathanAustralia
  2. 2.School of Information Technology and Electrical EngineeringThe University of QueenslandSt.LuciaAustralia
  3. 3.Riphah International UniversityRawalpindiPakistan

Personalised recommendations