Skip to main content
SpringerLink
Log in
Book cover

International Conference of B Users

B 2007: B 2007: Formal Specification and Development in B pp 109–124Cite as

Verification of LTL on B Event Systems

  • Conference paper

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

Abstract

This paper proposes a way to verify temporal properties expressed in LTL (Linear Temporal Logic) on B Event Systems. The method consists in generating a B representation of the Büchi automaton associated with the LTL property to verify. We establish the consistency of the generated event system implies the satisfaction of the LTL property on the executions of the original event system. We also characterize the subset of LTL preserved by the B refinement and we propose another refinement relation, with necessary and sufficient condition for preserving any given LTL property.

Research partially founded by the french ACI Geccoo.

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

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. Abrial, J.-R.: The B Book. Cambridge University Press, Cambridge (1996)

    Book  MATH  Google Scholar 

  2. Abrial, J.-R.: Extending B without changing it (for developing distributed systems). In: 1st Conference on the B method, Nantes, France, November 1996, pp. 169–190 (1996)

    Google Scholar 

  3. Abrial, J.-R., Cansell, D., Méry, D.: Refinement and Reachability in Event B. In: Treharne, H., King, S., C. Henson, M., Schneider, S. (eds.) ZB 2005. LNCS, vol. 3455, pp. 222–241. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  4. 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)

    Chapter  Google Scholar 

  5. Alpern, B., Demers, A.J., Schneider, F.B.: Safety without stuttering. Information Processing Letters 23(4), 177–180 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  6. Alpern, B., Schneider, F.B.: Recognizing safety and liveness. Distributed Computing 2(3), 117–126 (1987)

    Article  MATH  Google Scholar 

  7. Alpern, B., Schneider, F.B.: Verifying temporal properties without temporal logic. TOPLAS 11(1), 147–167 (1989)

    Article  MATH  Google Scholar 

  8. Barradas, H.R., Bert, D.: Specification and proof of liveness properties under fairness assumption in B event systems. In: Butler, M., Petre, L., Sere, K. (eds.) IFM 2002. LNCS, vol. 1993, Springer, Heidelberg (2002)

    Google Scholar 

  9. Potet, M.-L., Bert, D., Stouls, N.: Genesyst: a tool to reason about behavioral aspects of b event specifications. In: Treharne, H., King, S., C. Henson, M., Schneider, S. (eds.) ZB 2005. LNCS, vol. 3455, pp. 299–318. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  10. Darlot, C., Julliand, J., Kouchnarenko, O.: Refinement preserves PLTL properties. In: Bert, D., P. Bowen, J., King, S. (eds.) ZB 2003. LNCS, vol. 2651, Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  11. Gastin, P., Oddoux, D.: Fast LTL to Büchi automata translation. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol. 2102, pp. 53–65. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  12. Giorgetti, A., Groslambert, J.: JAG: JML Annotation Generation for Verifying Temporal Properties. In: Baresi, L., Heckel, R. (eds.) FASE 2006 and ETAPS 2006. LNCS, vol. 3922, pp. 373–376. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  13. Groslambert, J.: Verification of LTL on B Event System. Research Report RR2006-05, LIFC Université de Franche Comté (September 2006)

    Google Scholar 

  14. Groslambert, J.: A JAG extension for verifying LTL properties on B Event Systems. In: Julliand, J., Kouchnarenko, O. (eds.) B 2007. LNCS, vol. 4355, Springer, Heidelberg (2006)

    Google Scholar 

  15. Lamport, L.: Proving the correctness of multiprocess programs. IEEE Transactions on Software Engineering 3(2), 125–143 (1977)

    Article  MathSciNet  Google Scholar 

  16. Peled, D., Wilke, T.: Stutter-invariant temporal properties are expressible without the next-time operator. Inf. Process. Lett. 63(5), 243–246 (1997)

    Article  MathSciNet  Google Scholar 

  17. Pnueli, A.: The Temporal Logic of Program. In: 18th Ann. IEEE Symp. on foundations of computer science, pp. 46–57 (1977)

    Google Scholar 

  18. Prasad Sistla, A.: Safety, liveness and fairness in temporal logic. Formal Asp. Comput. 6(5), 495–512 (1994)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Université de Franche-Comté – LIFC – CNRS, 16 route de Gray, 25030, Besançon cedex, France

    Julien Groslambert

Authors
  1. Julien Groslambert
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. LIFC, Université de Franche-Comté, 16, route de Gray, F-25030, Besançon Cedex, France

    Jacques Julliand

  2. LIFC – TFC Team, 16 route de Gray, F-25030, Besançon

    Olga Kouchnarenko

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Groslambert, J. (2006). Verification of LTL on B Event Systems. 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_11

Download citation

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

  • 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

Search

Navigation