A JAG Extension for Verifying LTL Properties on B Event Systems

  • Julien Groslambert
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4355)


This paper presents an extension of the tool JAG for verifying temporal properties expressed in LTL (Linear Temporal Logic) on B Event Systems. The tool generates a machine containing a B representation of the Büchi automaton associated with the LTL property to verify and includes it within the original B event system. Then, the user have to prove the consistency of the generated event system. This proof of consistency implies the satisfaction of the LTL property on the executions of the original event system.


LTL Büchi Automaton Verification 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Abrial, J.-R.: The B Book. Cambridge University Press, Cambridge (1996)zbMATHCrossRefGoogle Scholar
  2. 2.
    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)CrossRefGoogle Scholar
  3. 3.
    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)CrossRefGoogle Scholar
  4. 4.
    Groslambert, J.: Verification of LTL on B event systems. In: Julliand, J., Kouchnarenko, O. (eds.) B 2007. LNCS, vol. 4355, Springer, Heidelberg (2006)Google Scholar
  5. 5.
    Pnueli, A.: The Temporal Logic of Program. In: 18th Ann. IEEE Symp. on foundations of computer science, pp. 46–57 (1977)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Julien Groslambert
    • 1
  1. 1.Université de Franche-Comté – LIFC – CNRSBesançon cedexFrance

Personalised recommendations