Skip to main content

Time Constraint Patterns for Event B Development

  • Conference paper
B 2007: Formal Specification and Development in B (B 2007)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 4355))

Included in the following conference series:

Abstract

Distributed applications are based on algorithms which should be able to deal with time constraints. It is mandatory to express time constraints in (mathematical) models and the current work intends to integrate time constraints in the modelling process based on event B models and refinement. The starting point of our work is the event B development of the IEEE 1394 leader election protocol; from standard documents, we derive temporal requirements to solve the contention problem and we propose a method for introducing time constraints using a pattern. The pattern captures time constraints in a generic event B development and it is applied to the IEEE 1394 case study.

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abadi, M., Lamport, L.: An old-fashioned recipe for real time. ACM Transactions on Programming Languages and Systems 16(5), 1543–1571 (1994)

    Article  Google Scholar 

  2. Abrial, J.-R.: Using Design Patterns in Formal Devlopments - Example: A Mechanical Press Controler. In: Journée scientifique du PPF IAEM Transversal - Développement incrémental et prouvé de systèmes (April 2006)

    Google Scholar 

  3. Abrial, J.-R.: B#: Toward a synthesis between z and b. In: Bert, et al. [12], pp. 168–177

    Google Scholar 

  4. Abrial, J.-R., Cansell, D.: Formal Construction of a Non-blocking Concurrent Queue Algorithm (a Case Study in Atomicity). Journal of Universal Computer Science 11(5), 744–770 (2005)

    Google Scholar 

  5. Abrial, J.-R., Cansell, D., Méry, D.: Formal derivation of spanning trees algorithms. In: Bert et al. [12], pp. 457–476

    Google Scholar 

  6. Abrial, J.-R., Cansell, D., Méry, D.: A mechanically proved and incremental development of IEEE 1394 tree identify protocol. Formal Asp. Comput. 14(3), 215–227 (2003)

    Article  Google Scholar 

  7. Abrial, J.-R., Cansell, D., Méry, D.: A new IEEE 1394 leader election protocol. In: Dagstuhl, S., Glaser, U., Abrial, J. (eds.) Rigorous Methods for Software Construction and Analysis Seminar N 06191,07.05.-12.05.06 (2006)

    Google Scholar 

  8. Alur, R., Dill, D.L.: A theory of timed automata. Theoretical Computer Science 126(2), 183–235 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  9. Badeau, F., Amelot, A.: Using B as a high level programming language in an industrial project: Roissy val. In: Treharne, H., King, S., Henson, M.C., Schneider, S. (eds.) ZB 2005. LNCS, vol. 3455, pp. 334–354. Springer, Heidelberg (2005)

    Google Scholar 

  10. Behm, P., Benoit, P., Faivre, A., Meynadier, J.-M.: METEOR: A successful application of B in a large project. In: Wing, J.M., Woodcock, J.C.P., Davies, J. (eds.) FM 1999. LNCS, vol. 1708, pp. 369–387. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  11. Bengtsson, J., Larsen, K.G., Larsson, F., Pettersson, P., Yi, W.: UPPAAL - a tool suite for automatic verification of real-time systems. In: Hybrid Systems, pp. 232–243 (1995)

    Google Scholar 

  12. Bert, D., Bowen, J.P., King, S. (eds.): ZB 2003. LNCS, vol. 2651. Springer, Heidelberg (2003)

    Google Scholar 

  13. Cansell, D.: Assistance au développement incrémental et à sa preuve. In: Habilitation à diriger des recherches, Université Henri Poincaré (Nancy 1) (2003)

    Google Scholar 

  14. Cansell, D., Méry, D.: Formal and Incremental Construction of Distributed Algorithms: On the Distributed Reference Counting Algorithm. Theoretical Computer Science (to appear, 2006)

    Google Scholar 

  15. Daws, C., Olivero, A., Tripakis, S., Yovine, S.: The tool KRONOS. In: Hybrid Systems III: Verification and Control, Rutgers University, New Brunswick, NJ, USA, October 22–25, 1995, vol. 1066, pp. 208–219. Springer, Heidelberg (1995)

    Google Scholar 

  16. Devillers, M., Griffioen, W.O.D., Romijn, J., Vaandrager, F.W.: Verification of a leader election protocol: Formal methods applied to ieee 1394. Formal Methods in System Design 16(3), 307–320 (2000)

    Article  Google Scholar 

  17. Fidge, C.J., Wellings, A.J.: An action-based formal model for concurrent real-time systems. Formal Aspects of Computing 9(2), 175–207 (1997)

    Article  MATH  Google Scholar 

  18. Gamma, E., Helm, R., Johnson, R.E., Vlissides, J.M.: Design patterns: Abstraction and reuse of object-oriented design. In: Nierstrasz, O. (ed.) ECOOP 1993. LNCS, vol. 707, pp. 406–431. Springer, Heidelberg (1993)

    Chapter  Google Scholar 

  19. Lamport, L.: Real time is really simple. Technical Report MSR-TR-2006-30 (March 2005)

    Google Scholar 

  20. Romijn, J.: A timed verification of the ieee 1394 leader election protocol. Formal Methods in System Design 19(2), 165–194 (2001)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cansell, D., Méry, D., Rehm, J. (2006). Time Constraint Patterns for Event B Development. In: Julliand, J., Kouchnarenko, O. (eds) B 2007: Formal Specification and Development in B. B 2007. Lecture Notes in Computer Science, vol 4355. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11955757_13

Download citation

  • DOI: https://doi.org/10.1007/11955757_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-68760-3

  • Online ISBN: 978-3-540-68761-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics