On Verification of a Distributed Algorithm of Databases Arranged as a Ring

In a paper, Roscoe has proposed two algorithms that can preserve a form of consistency in the distributed databases arranged a ring, and validated them using a group like algebra, invented by the same author. In this paper, we have simplified one of the algorithms and tried to validate it by applying a simple set theory. We suppose that each process located at a node of the ring emits one only one update in its history and all processes insert their updates in the ring at the same time. The behavior of the system is synchronized by a global system clock, and at each tick of the system clock, all updates move to their right neighbors.