Xeve, an Esterel verification environment

  • Amar Bouali
Tool Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1427)


We describe the verification methods and tools we are currently developing around the language ESTEREL. This language is dedicated for the development of synchronous reactive systems such as hardware or software controllers for which the control handling aspects are predominant. The language has a strong mathematical semantics in terms of Finite State Machines. Automatic verification is then possible on this model in which we represent exhaustively all the possible behaviors of a system. Our methods are based on model minimization coupled with unrelevant behaviors masking and model checking techniques to verify correctness properties like safety and liveness ones by means of synchronous observers


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    G. Berry, and G. Gonthier The Esterel Synchronous Programming Language: Design, Semantics, Implementation Science Of Computer Programming, 19(2):87–152, 1992.CrossRefGoogle Scholar
  2. 2.
    A. Bouali, A. Ressouche, V. Roy, and R. de Simone. The FC2Tools set. In Proceedings of CAV'96 vol. 1102 of LNCS, 1996.Google Scholar
  3. 3.
    A. Bouali. XEVE: an ESTEREL Verification Environment (Version v1_3). Technical Report 214, INRIA, December 1997. http://ftp-sop.inria.fr/pub/rapports/RT214.ps.Google Scholar
  4. 4.
    A. Bouali and R. de Simone. Symbolic bisimulation minimisation. In Fourth Workshop on Computer-Aided Verification, volume 663 of LNCS, pages 96–108, Montreal, 1992. Springer-Verlag.Google Scholar
  5. 5.
    J.R. Burch, E.M. Clarke, K.L. McMillan, D.L. Dill, and L.J. Hwang. Symbolic model checking 10220 states and beyond. Information and Computation, 98(2):142–170, June 1992.CrossRefGoogle Scholar
  6. 6.
    O. Coudert, C. Berthet, and J.C. Madre. Verification of synchronous sequential machines based on symbolic execution. In Automatic Verification Methods For Finite State Systems, Grenoble, France, 1989. LNCS 407, Springer-Verlag.Google Scholar
  7. 7.
    P.C. Kanellakis and S.A. Smolka. CCS expressions, finite state processes, and three problems of equivalence. Information and Computation, 86:43–68, 1990.CrossRefGoogle Scholar
  8. 8.
    Mc Millan. Symbolic Model Checking. Kluwer Academic Publishers, 1993.Google Scholar
  9. 9.
    D.M.R. Park. Concurrency and automata on infinite sequences. In P. Deussen, editor, 5 th GI Conference, vol. 104 of LNCS, 1981.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Amar Bouali
    • 1
  1. 1.INRIASophia-Antipolis cedex

Personalised recommendations