论文标题
汇款简单：规格，通用算法及其证明
Money Transfer Made Simple: a Specification, a Generic Algorithm, and its Proof
论文作者
论文摘要
最近已经表明，与普遍的信念相反，在存在错误（拜占庭）过程的情况下，汇款不需要强烈的共识，例如共识。本文更进一步：即，它首先提出了对货币转移对象的非序列规范，然后根据每对实现其实现的一对流程之间的简单FIFO顺序提出了一种通用算法。通用维度在于基本可靠的广播抽象，必须适合适当的失败模型。有趣的是，无论失败模型如何，货币转移算法都只需要在其消息中添加一个序列编号作为控制信息。此外，作为拟议算法的副作用，货币转移比在异步消息传播的碰撞模型中的安全/常规/原子读/写寄存器的构建要弱。
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 abstraction 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.
