HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

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.
Document type :
Complete list of metadata

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Wednesday, May 24, 2006 - 1:16:48 PM
Last modification on : Friday, February 4, 2022 - 3:16:56 AM
Long-term archiving on: : Sunday, April 4, 2010 - 11:51:30 PM


  • 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⟩



Record views


Files downloads