Formalising Behaviour Trees with CSP
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.
KeywordsRequirements engineering model checking Behaviour Trees CSP
Unable to display preview. Download preview PDF.
- [BRJ99]Booch, G., Rumbaugh, J., Jacobson, I.: The Unified Modelling Language User Guide. Addison-Wesley, Reading (1999)Google Scholar
- [Dro03]Dromey, R.G.: From requirements to design: Formalizing the key steps. In: Cerone, A., Lindsay, P. (eds.) Int. Conference on Software Engineering and Formal Methods (SEFM 2003), pp. 2–11. IEEE Computer Society, Los Alamitos (2003)Google Scholar
- [For96]Formal Systems (Europe) Ltd. Failure Divergence Refinement, FDR 2.0, User Manual (August 1996)Google Scholar
- [HD99]Harel, D., Damm, W.: LSCs: Breathing life into message sequence charts. In: Ciancarini, P., Fantechi, A., Gorrieri, R. (eds.) IFIP Conference on Formal Methods for Open Object-Based Distributed Systems (FMOODS 1999), pp. 293–312. Kluwer Academic Publishers, Dordrecht (1999)Google Scholar
- [Ros98]Roscoe, A.W.: The Theory and Practice of Concurrency. Series in Computer Science. Prentice-Hall, Englewood Cliffs (1998)Google Scholar