Advertisement

Managing LTL Properties in Event-B Refinement

  • Steve Schneider
  • Helen Treharne
  • Heike Wehrheim
  • David M. Williams
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8739)

Abstract

Refinement in Event-B supports the development of systems via proof based step-wise refinement of events. This refinement approach ensures safety properties are preserved, but additional reasoning is required in order to establish liveness and fairness properties.In this paper we present results which allow a closer integration of two formal methods, Event-B and linear temporal logic. In particular we show how a class of temporal logic properties can carry through a refinement chain of machines. Refinement steps can include introduction of new events, event renaming and event splitting. We also identify a general liveness property that holds for the events of the initial system of a refinement chain. The approach will aid developers in enabling them to verify linear temporal logic properties at early stages of a development, knowing they will be preserved at later stages. We illustrate the results via a simple case study.

Keywords

Model Check Linear Temporal Logic Proof Obligation Anticipate Event Liveness Property 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Abrial, J.-R.: Modeling in Event-B: System and Software Engineering. Cambridge University Press (2010)Google Scholar
  2. 2.
    Abrial, J.-R., Butler, M.J., Hallerstede, S., Hoang, T.S., Mehta, F., Voisin, L.: Rodin: an open toolset for modelling and reasoning in Event-B. STTT 12(6), 447–466 (2010)CrossRefGoogle Scholar
  3. 3.
    Abrial, J.-R., Mussat, L.: Introducing dynamic constraints in B. In: Bert, D. (ed.) B 1998. LNCS, vol. 1393, pp. 83–128. Springer, Heidelberg (1998)Google Scholar
  4. 4.
    Barradas, H., Bert, D.: Specification and proof of liveness properties under fairness assumptions in B event systems. In: Butler, M., Petre, L., Sere, K. (eds.) IFM 2002. LNCS, vol. 2335, pp. 360–379. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  5. 5.
    Feige, U., Arenas, A.E., Aziz, B., Massonet, P., Ponsard, C.: Towards modelling obligations in event-B. In: Börger, E., Butler, M., Bowen, J.P., Boca, P. (eds.) ABZ 2008. LNCS, vol. 5238, pp. 181–194. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  6. 6.
    Butler, M.J.: A CSP approach to Action Systems. DPhil thesis, Oxford U. (1992)Google Scholar
  7. 7.
    Derrick, J., Smith, G.: Temporal-logic property preservation under Z refinement. Formal Asp. Comput. 24(3), 393–416 (2012)CrossRefzbMATHMathSciNetGoogle Scholar
  8. 8.
    Groslambert, J.: Verification of LTL on B Event Systems. In: Julliand, J., Kouchnarenko, O. (eds.) B 2007. LNCS, vol. 4355, pp. 109–124. Springer, Heidelberg (2006)Google Scholar
  9. 9.
    Hallerstede, S., Leuschel, M., Plagge, D.: Validation of formal models by refinement animation. Science of Computer Programming 78(3), 272–292 (2013)CrossRefzbMATHGoogle Scholar
  10. 10.
    Hoang, T.S., Abrial, J.-R.: Reasoning about liveness properties in Event-B. In: Qin, S., Qiu, Z. (eds.) ICFEM 2011. LNCS, vol. 6991, pp. 456–471. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  11. 11.
    Leuschel, M., Butler, M.J.: ProB: an automated analysis toolset for the B method. STTT 10(2), 185–203 (2008)CrossRefGoogle Scholar
  12. 12.
    Leuschel, M., Falampin, J., Fritz, F., Plagge, D.: Automated property verification for large scale B models. In: Cavalcanti, A., Dams, D.R. (eds.) FM 2009. LNCS, vol. 5850, pp. 708–723. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  13. 13.
    Morgan, C.: Of wp and CSP. Beauty is our business: a birthday salute to E. W. Dijkstra, pp. 319–326 (1990)Google Scholar
  14. 14.
    Plagge, D., Leuschel, M.: Seven at one stroke: LTL model checking for high-level specifications in B, Z, CSP, and more. STTT 12(1), 9–21 (2010)CrossRefGoogle Scholar
  15. 15.
    Schneider, S., Treharne, H., Wehrheim, H.: The behavioural semantics of Event-B refinement. Formal Asp. Comput. 26(2), 251–280 (2014)CrossRefMathSciNetGoogle Scholar
  16. 16.
    Schneider, S., Treharne, H., Wehrheim, H., Williams, D.: Managing LTL properties in Event-B refinement. arXiv:1406:6622 (June 2014)Google Scholar
  17. 17.
    Williams, D.M., de Ruiter, J., Fokkink, W.: Model checking under fairness in ProB and its application to fair exchange protocols. In: Roychoudhury, A., D’Souza, M. (eds.) ICTAC 2012. LNCS, vol. 7521, pp. 168–182. Springer, Heidelberg (2012)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Steve Schneider
    • 1
  • Helen Treharne
    • 1
  • Heike Wehrheim
    • 2
  • David M. Williams
    • 3
  1. 1.University of SurreySurreyEngland, UK
  2. 2.University of PaderbornPaderbornGermany
  3. 3.VU University AmsterdamAmsterdamNetherlands

Personalised recommendations