|
One of the benefits of the synchronous data-flow approach is that a program defines a perfectly deterministic behavior. But the use of the delay primitive leads to undefined values at the first cycle; thus a data-flow program is really deterministic only if it can be shown that such undefined values do not affect the behavior of the system. This paper presents an initialization analysis that guarantees the deterministic behavior of programs. This analysis has been implemented in the Lucid Synchrone compiler and in a SCADE-Lustre prototype compiler.
|
||||||
|
||||||
|
||||||
