A Canonical Form for Affine Relations in Signal

Irina Smarandache 1 Paul Le Guernic 1
1 EP-ATR - Environnement de programmation d'applications temps réel
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, INRIA Rennes
Abstract : In this paper we present affine transformations as an extension of the Signal language for the specification and validation of real-time applications. A Signal program is a system of equations which specify dependencies between program data and synchronization constraints on clock variables. In order to test if a program is functionally safe, the Signal compiler resolves the clock constraints and verifies that the data dependency graph contains no cycles. By means of the new transformations, affine relations can be defined between clock variables and it gets necessary to enhance the compiler with facilities for the resolution of synchronization constraints on these clocks. To tackle these constraints, we propose an extension of the compiler based essentially on a canonical form of the affine relations. This extension removes some of the limits of the existing compiler and enlarges the range of applications that can be validated using Signal.
Type de document :
[Research Report] RR-3097, INRIA. 1997
Liste complète des métadonnées

Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 13:16:48
Dernière modification le : jeudi 11 janvier 2018 - 06:20:09
Document(s) archivé(s) le : dimanche 4 avril 2010 - 23:51:30



  • HAL Id : inria-00073594, version 1



Irina Smarandache, Paul Le Guernic. A Canonical Form for Affine Relations in Signal. [Research Report] RR-3097, INRIA. 1997. 〈inria-00073594〉



Consultations de la notice


Téléchargements de fichiers