Skip to main content

Formalising Behaviour Trees with CSP

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2999))

Abstract

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.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bolton, C., Davies, J.: Activity graphs and processes. In: Grieskamp, W., Santen, T., Stoddart, B. (eds.) IFM 2000. LNCS, vol. 1945, pp. 77–96. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  2. Booch, G., Rumbaugh, J., Jacobson, I.: The Unified Modelling Language User Guide. Addison-Wesley, Reading (1999)

    Google Scholar 

  3. 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 

  4. Formal Systems (Europe) Ltd. Failure Divergence Refinement, FDR 2.0, User Manual (August 1996)

    Google Scholar 

  5. Harel, D.: Statecharts: Visual formalism for complex systems. Science of Computer Programming 8, 231–274 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  6. 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 

  7. Hoare, C.A.R.: Communicating Sequential Processes. Series in Computer Science. Prentice-Hall, Englewood Cliffs (1985)

    MATH  Google Scholar 

  8. Ng, M.Y., Butler, M.: Tool support for visualizing CSP in UML. In: George, C.W., Miao, H. (eds.) ICFEM 2002. LNCS, vol. 2495, pp. 287–298. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  9. Roscoe, A.W.: The Theory and Practice of Concurrency. Series in Computer Science. Prentice-Hall, Englewood Cliffs (1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Winter, K. (2004). Formalising Behaviour Trees with CSP. In: Boiten, E.A., Derrick, J., Smith, G. (eds) Integrated Formal Methods. IFM 2004. Lecture Notes in Computer Science, vol 2999. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24756-2_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24756-2_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-21377-2

  • Online ISBN: 978-3-540-24756-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics