Skip to main content

Using a Process Algebra to control B OPERATIONS

  • Conference paper
IFM’99

Abstract

The B-Method is a state-based formal method that describes system behaviour in terms of MACHINES whose state changes under OPERATIONS. The process algebra CSP is an event-based formalism that enables descriptions of patterns of system behaviour. This paper is concerned with the combination of these complementary views, in which CSP is used to describe the control executive for a B Abstract System. We discuss consistency between the two views and how it can be formally established. A typical avionics system motivates the work. Its specification and control executive are presented in the paper. The relationship with other approaches is also discussed.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abrial J. R.: The B Book: Assigning Programs to Meaning, Cambridge University Press (1996).

    Book  Google Scholar 

  2. Abrial J.R.: Extending B without Changing it (for Developing Distributed Systems). In H. Habrias, editor, Proceedings of the 1st B Conference, Nantes, France, November (1996).

    Google Scholar 

  3. Back R.J.R. and Kurki-Suonio R.: Decentralization of process nets with centralized control. In proceedings 2nd ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, Montreal (1983).

    Google Scholar 

  4. Butler M.J.: Event Ordering in Action Systems. In J. Grundy, M.Schwenke, T. Wickers, editors, International Refinement Workshop/Formal Methods Pacific’98, Canberra, Springer Series in Discrete Mathematics and Computer Science, Springer (1998).

    Google Scholar 

  5. Draper J., Treharne H. et al.: Evaluating the B-Method on an Avionics Example. In proceedings of DASIA, Data Systems in Aerospace, Rome (1996).

    Google Scholar 

  6. Dijkstra J.: A Discipline of Programming, Prentice-Hall (1976).

    MATH  Google Scholar 

  7. Fischer C.: How to combine Z with a Process Algebra. In J. Bowen, A. Fett, and M.Hinchey, editors, ZUM’98 The Z formal Specification Notation, volume 1493 of LNCS, Springer Verlag (1998), pp 5–23.

    Chapter  Google Scholar 

  8. Fischer C.:CSP-OZ: A combination of Object-Z and CSP. In H. Bowman and J. Derrick, editors, Formal Methods for Open Object-Based Distributed Systems (FMOODS’97), volume2, Chapman & Hall (1997), pp 423–438.

    Google Scholar 

  9. Hoare C.A.R.: Communicating Sequential Processes, Prentice Hall (1985).

    MATH  Google Scholar 

  10. Morgan C.C.: Of wp and CSP. In W.H.J. Feijen, A.J.M. van Gasteren, D. Gries and J. Misra, editors, Beauty is our business: a birthday salute to Edsger W. Dijkstra. Springer Verlag (1990), pp 319–326.

    Google Scholar 

  11. Smith G.: A semantic integration of Object-Z and CSP for the specification of concurrent systems. In J. Fitzgerald, C. B. Jones and P. Lucas, editors, Proceedings of FME 1997, volume 1313 of LNCS, Springer Verlag (1997), pp 62–81.

    Google Scholar 

  12. Roscoe A. W., Woodcock J. C. P. and Wulf L.: Non-interference through determinism. In D. Gollmann, editor, ESORICS 94, volume 875 of LNCS, Springer Verlag (1994), pp 33–54.

    Google Scholar 

  13. Stoy, J. E.: Denotational Semantics, MIT Press (1977).

    Google Scholar 

  14. Treharne H., Schneider S.: Using a Process Algebra to control B OPERATIONS (Full Version). Technical Report CSD-TR-99–01, Royal Holloway, University of London, February (1999).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag London Limited

About this paper

Cite this paper

Treharne, H., Schneider, S. (1999). Using a Process Algebra to control B OPERATIONS. In: Araki, K., Galloway, A., Taguchi, K. (eds) IFM’99. Springer, London. https://doi.org/10.1007/978-1-4471-0851-1_23

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-0851-1_23

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-85233-107-8

  • Online ISBN: 978-1-4471-0851-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics