vault backup: 2025-03-03 19:31:59

This commit is contained in:
Marco Realacci 2025-03-03 19:31:59 +01:00
parent 8cebb49ee6
commit cae5b89ce9

View file

@ -226,5 +226,8 @@ Reverse induction on
Base ($=n-1$): trivial
Induction (true for +1, to be proved for ):
- Assume a $p_x$ blocked at level $\to \exists k\neq x, F[k]\geq+1 \land A\_Y[+1]=x$
-
- Assume a $p_x$ blocked at level (aka blocked in its +1-th wait) $\to \exists k\neq x, F[k]\geq+1 \land A\_Y[+1]=x$
- If some $p_{y}$ will eventually set $A\_Y[+1]$ to $y$, then $p_x$ will eventually exit from its wait and pass to level +1
- Otherwise, let $G = {$