vault backup: 2025-03-08 18:16:57

Concurrent Systems/notes/1b - Peterson algorithm.md

@@ -90,9 +90,10 @@ unlock(i) :=
 	FLAG[i] <- 0
 	return
 ```
-We say that:
-if $p_i$ is at level $h$ when it exits from the $h$-th wait $\to$ a process at level $h$ is at any level $<= h$
+We say that: $p_i$ is at level $h$ when it exits from the $h$-th wait $\to$ a process at level $h$ is at any level $<= h$
 
+>[!info] What is the `wait` condition actually checking?
+>In the wait condition we check that all other processes are at a lower level.
 ##### MUTEX proof
 Lemma: for every $ℓ \in \{0,\dots,n-1\}$ , at most n-ℓ processes are at level ℓ, this implies MUTEX by taking ℓ = n-1