-
-
-
-
CENAPAD-MGCO
A seguir: Theorem 1: Scanning the
Acima: O Algoritmo de Naimi-Trehel
Anterior: Theorem 1
-
A2
A3
A4
A5 hold initially:
-
Node 1 is the only node that has HasToken = TRUE,
and it is the unique root.
-
Every
node j, j
i,
node 1, since
- all input channels and ReqLists are initially empty, and thus conditions
2 to
6 do not apply to any node;
- Next[1] = nil, and Next[2] = Next[3] =
Next[N] = 1 initially.
Osvaldo Carvalho
-
Postscript -
Comentários?