Behaviour Trees is a novel approach for requirements engineering. It advocates a graphical tree notation that is easy to use and to understand. Individual requirements are modelled as single trees which later on are integrated into a model of the system as a whole. We develop a formal semantics for a subset of Behaviour Trees using CSP. This work, on one hand, provides tool support for Behaviour Trees. On the other hand, it builds a front-end to a subset of the CSP notation and gives CSP users a new modelling strategy which is well suited to the challenges of requirements engineering. Keywords: Requirements engineering, model checking, Behaviour Trees, CSP. © Springer-Verlag 2004.
CITATION STYLE
Winter, K. (2004). Formalising Behaviour Trees with CSP. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2999, 148–167. https://doi.org/10.1007/978-3-540-24756-2_9
Mendeley helps you to discover research relevant for your work.