Handling State-Machines Specifications with GATeL

https://doi.org/10.1016/j.entcs.2010.12.011Get rights and content
Under a Creative Commons license
open access

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.

Keywords

Reactive systems
State-Machines
Test Generation
Constraint Logic Programming

Cited by (0)

This work is supported by project ANR-07-TLOG-019 and IRSN nuclear safety agency.