From a1eb0881904361367555c5543619fedb14c2057c Mon Sep 17 00:00:00 2001 From: Marco Realacci Date: Tue, 25 Mar 2025 18:22:22 +0100 Subject: [PATCH] vault backup: 2025-03-25 18:22:22 --- .../notes/8 - Enhancing Liveness Properties.md | 6 +++++- 1 file changed, 5 insertions(+), 1 deletion(-) diff --git a/Concurrent Systems/notes/8 - Enhancing Liveness Properties.md b/Concurrent Systems/notes/8 - Enhancing Liveness Properties.md index ce2a03f..c6a10fc 100644 --- a/Concurrent Systems/notes/8 - Enhancing Liveness Properties.md +++ b/Concurrent Systems/notes/8 - Enhancing Liveness Properties.md @@ -135,4 +135,8 @@ Since ⟨ti,i⟩ is the minimum index of a non-terminating invocation Since $p_i$ is correct, eventually (for all $p_k$ correct): - i will not be anymore in $suspected_{i}$ (as $p_i$ will not crash as its correct) - $⟨ti,i⟩ = min\{⟨TS[x],x⟩ \space|\space x \in competing_{k}\}$ (all pk will select pi as the minimum) -Hence, the invocation with index ⟨ti,i⟩ will eventually have exclusive execution, and because of obstruction freedom it eventually terminates. \ No newline at end of file +Hence, the invocation with index ⟨ti,i⟩ will eventually have exclusive execution, and because of obstruction freedom it eventually terminates. + +#### On implementing ♢P +- every non-failed process has eventually an upper bound on the write delay +- by properly setting timers, eventually crashed processes are distinguished from the non-crashed ones by looking at the suspicions: for the crashed ones, this numbers increases indefinitely; for non-crashed ones, some reset eventually happens. \ No newline at end of file