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

vault backup: 2025-03-25 09:28:01

Browse source
This commit is contained in:
Marco Realacci 2025-03-25 09:28:01 +01:00
parent 124d580bad
commit 8700f85c8f
1 changed files with 10 additions and 1 deletions
Download patch file Download diff file Expand all files Collapse all files

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

@ -87,4 +87,13 @@ 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.
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
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
```
TS[1..n] : SWMR atomic R/W registers init at 0
...
```