vault backup: 2025-03-25 09:28:01
This commit is contained in:
parent
124d580bad
commit
8700f85c8f
1 changed files with 10 additions and 1 deletions
|
@ -88,3 +88,12 @@ 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
|
||||
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
|
||||
|
||||
...
|
||||
```
|
Loading…
Add table
Add a link
Reference in a new issue