63e090633c
The following node was accepted by the causality analysis:
node m(x:int) = (y,z:int)
let
automaton
state A
do
y = x + z;
z = x + 1;
until x = 3 then B
state B
do
y = x + 3;
z = y * x;
until x = 10 then A
end
tel
Each state is indeed causal, but once the automaton is translated to equations
(which is the systematic way in the current version), the node is not
schedulable.
Correction: all "Or" of dependency constraints translated to "And".
This constraint could be relaxed if code generation is done from Heptagon code,
before translation to minils equations.
|
||
|---|---|---|
| .. | ||
| causal.ml | ||
| causality.ml | ||
| hept_clocking.ml | ||
| initialization.ml | ||
| linear_typing.ml | ||
| stateful.ml | ||
| typing.ml | ||
| unsafe.ml | ||