marcorealacci/master-degree-notes
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

vault backup: 2025-03-25 17:07:22

Browse source
This commit is contained in:
Marco Realacci 2025-03-25 17:07:22 +01:00
parent 1eef509d01
commit 51be7d3a8f
1 changed files with 3 additions and 3 deletions
Download patch file Download diff file Expand all files Collapse all files

6
Concurrent Systems/notes/8 - Enhancing Liveness Properties.md
View file

@ -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
```