UFMG - Pós-graduação em Ciência da Computação - Programação Paralela

A seguir: Theorem 1: Scanning the Acima: Progress: the Graph Anterior: Theorem 1

Theorem 1: Initial Conditions

• A2 $\wedge$ A3 $\wedge$ A4 $\wedge$ A5 hold initially:
• Node 1 is the only node that has HasToken = TRUE, and it is the unique root.
• Every node j, j $\neq$ i, node 1, since
  • all input channels and ReqLists are initially empty, and thus conditions ${\cal D}$2 to ${\cal D}$6 do not apply to any node;
  • Next[1] = nil, and Next[2] = Next[3] = $\ldots$ Next[N] = 1 initially.