Handling State-Machines Specifications with GATeL

  • Authors:
  • Benjamin Blanc;Christophe Junke;Bruno Marre;Pascale Le Gall;Olivier Andrieu

  • Affiliations:
  • CEA, LIST - Software Reliability Lab (LSL);CEA, LIST - Software Reliability Lab (LSL);CEA, LIST - Software Reliability Lab (LSL);MAS Laboratory - ícole Centrale Paris & Universitéé d'Evry;Esterel Technologies

  • Venue:
  • Electronic Notes in Theoretical Computer Science (ENTCS)
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

GATeL proposes a testing environment for Lustre/Scade programs. Its main component is a resolution procedure based on a CLP interpretation of its input language. This paper presents a two-tier extension of GATeL in order to take into account state-machines descriptions. This extension relies on a compilation of these constructs into multi-clocked expressions. Our first contribution is a definition of explicit constraints to manage the clock type hierarchy in GATeL. The second one is the definition of constraints reflecting properties of state-machines built by the Scade compilation schema.