Common Contracts

Anonymous obstruction-free (n,k)-set agreement with n–k+1 atomic read/write registers

March 22nd, 2017

• Filed
  March 22nd, 2017

Proof The proof is by contradiction. Let pi be the first process that executes a write W(−, X) con- tradicting the lemma. This means that W(−, X) is not covering a register of REG at time τ and X /⊒ REGτ [x]. Let this write occur at time τ2 > τ . Thus, all writes that take place between τ and τ2 comply with the lemma. We derive a contradiction by showing that X ⊒ REGτ [x].

Anonymous obstruction-free (n,k)-set agreement with n–k+1 atomic read/write registers

March 22nd, 2017

• Filed
  March 22nd, 2017

Proof The proof is by contradiction. Let pi be the first process that executes a write W(−, X) con- tradicting the lemma. This means that W(−, X) is not covering a register of REG at time τ and X ƒ⊒ REG τ [x]. Let this write occur at time τ2 > τ . Thus, all writes that take place between τ and τ2 comply with the lemma. We derive a contradiction by showing that X ⊒ REG τ [x].