SYRF Project

Work Package 2: "Combination of Formalisms"

Abstract of deliverable 2.1

Back to the SYRF Home Page  

Approach:

Data-flow formalisms for synchronous reactive programming, such as Lustre and Signal, essentially compile into definitional equation systems with additional registers. This compilation process amounts to a great extend to a clock resolution calculus. Variables and operators in the equation system may belong to various types.

On the other hand imperative languages like Esterel (but also most graphical formalisms of Statechart influence) produce purely boolean equation systems, with additional boolean variables inserted to drive memory operations on data, these operations being stored in a side action table. This corresponds to a separation between control and data flows.

The work package WP 2 of the project intends to integrate / unify both these points of view. Several routes have been pursued at present to achieve a combination of synchronous formalisms: 

Achieved Results:

Publications:

  1. GMD-EES.
    The Synchronie Workbench
  2. L.Holenderski, A.Poigné.
    The Multi-Paradigm Language LEA
    Annex A.2.1a
  3. L.Holenderski.
    Translating LEA to Synchronous Components.
    Arbeitspapiere der GMD, Nr. 1090
  4. A. Ressouche, R. de Simone
    The SCDC processor, illustrated on a SYRF case study.
    Internal report. Annex A.2.1b
  5. F.Maranchini, Y.Rémond
    Mode-Automata: About Modes and States in Reactive Systems.
    Research Report, Verimag. Annex A.2.1c