Fig. 1
From: Timing analysis of leader-based and decentralized Byzantine consensus algorithms
Overview of the Byzantine consensus algorithms (the arrows represent function calls; \(S_{p}^{r}\) and \(T_{p}^{r}\) are the sending and transition functions introduced in Sect. 2.2)