Synchronous data-flow programming is based on the abstraction of the continuous time into a discrete one. It offers verification and proof techniques appreciated by programmers of critical reactive systems. Armed with a strong semantics, the synchronous data-flow languages (Signal, Lustre,...) generally lead to strongly synchronized executions. In the case of distributed implementations, some constraints, introduced by the specification itself, are very prejudiciable in terms of performance.
To conciliate rigorous specification and efficient implementations, we introduce a new model for real-time applications, fitted to the synchronous approach, and ables to describe programs from their specifications to their final distributed implementations. Thanks to this model we show the desynchronization process leading to desynchronized executions from a synchronized specification.
In Proceedings of the 11th International Conference on Systems Engineering ICSE'96, Las Vegas, Nevada, July 9-11, 1996. Pascal Aubry and Thierry Gautier, IRISA/INRIA, Campus de Beaulieu, F-35042 Rennes Cedex
Télécharger (format PDF)