- - - - CENAPAD-MGCO

contents index A seguir: Progress: the Graph Acima: O Algoritmo de Naimi-Trehel Anterior: Rules


Proof of Mutual Exclusion

Predicate A1 bellow is an inductive invariant[*].
\begin{displaymath}
A1 \equiv \left\{ 
\begin{array}
{l}
\forall i, eating[i] \L...
 ...all j, \neg HasToken[j]
 \end{array} \right.
\end{array}\right.\end{displaymath} (4)


Osvaldo Carvalho - Postscript - Comentários?