From 51be7d3a8fb14964cd255276114237e91f0d5542 Mon Sep 17 00:00:00 2001 From: Marco Realacci Date: Tue, 25 Mar 2025 17:07:22 +0100 Subject: [PATCH] vault backup: 2025-03-25 17:07:22 --- .../notes/8 - Enhancing Liveness Properties.md | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/Concurrent Systems/notes/8 - Enhancing Liveness Properties.md b/Concurrent Systems/notes/8 - Enhancing Liveness Properties.md index 0def713..b34e53c 100644 --- a/Concurrent Systems/notes/8 - Enhancing Liveness Properties.md +++ b/Concurrent Systems/notes/8 - Enhancing Liveness Properties.md @@ -94,9 +94,9 @@ Forall i $\Omega_{X}$ is not stronger than ♢P (so, ♢P is strictly stronger) -The formal proof consists in showing that if $\Omega$ was stronger than ♢P, then consensus would be possible in an asynchronous system with crashes and atomic R/W registers. - -#### From obstruction-freedom to wait-freedom +The formal proof consists in showing that if $\Omega_{X}$ was stronger than ♢P, then consensus would be possible in an asynchronous system with crashes and atomic R/W registers. +(because ♢P can solve consensus, ) +#### A contention manager for ♢P We assume a weak timestamp generator, i.e. a function such that, if it returns a positive value t to some process, only a finite number of invocations can obtain a timestamp smaller than or equal to t ```