Money Transfer Made Simple: a Specification, a Generic Algorithm, and its Proof - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Bulletin- European Association for Theoretical Computer Science Année : 2020

Money Transfer Made Simple: a Specification, a Generic Algorithm, and its Proof

Résumé

It has recently been shown that, contrarily to a common belief, money transfer in the presence of faulty (Byzantine) processes does not require strong agreement such as consensus. This article goes one step further: namely, it first proposes a non-sequential specification of the money-transfer object, and then presents a generic algorithm based on a simple FIFO order between each pair of processes that implements it. The genericity dimension lies in the underlying reliable broadcast ab- straction which must be suited to the appropriate failure model. Interestingly, whatever the failure model, the money transfer algorithm only requires adding a single sequence number to its messages as control information. Moreover, as a side effect of the proposed algorithm, it follows that money transfer is a weaker problem than the construction of a safe/regular/atomic read/write register in the asynchronous message-passing crash-prone model.
Fichier principal
Vignette du fichier
MT-Crash-Byzantin-EATCS-V2.pdf (185.56 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-02861511 , version 1 (09-06-2020)
hal-02861511 , version 2 (17-06-2020)
hal-02861511 , version 3 (16-02-2021)

Identifiants

Citer

Alex Auvolat, Davide Frey, Michel Raynal, François Taïani. Money Transfer Made Simple: a Specification, a Generic Algorithm, and its Proof. Bulletin- European Association for Theoretical Computer Science, 2020, 132. ⟨hal-02861511v3⟩
306 Consultations
725 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More