Modelling the Raft Distributed Consensus Protocol in mCRL2 (2403.18916v1)
Abstract: The consensus problem is a fundamental problem in distributed systems. It involves a set of actors, or entities, that need to agree on some values or decisions. The Raft algorithm is a solution to the consensus problem that has gained widespread popularity as an easy-to-understand and implement alternative to Lamport's Paxos algorithm. In this paper we discuss a formalisation of the Raft algorithm and its associated correctness properties in the mCRL2 specification language.
- In Tomás Vojnar & Lijun Zhang, editors: Tools and Algorithms for the Construction and Analysis of Systems - 25th International Conference, TACAS 2019, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019, Prague, Czech Republic, April 6-11, 2019, Proceedings, Part II, Lecture Notes in Computer Science 11428, Springer, pp. 21–39, 10.1007/978-3-030-17465-1_2.
- Sjoerd Cranen, Bas Luttik & Tim A. C. Willemse (2013): Proof Graphs for Parameterised Boolean Equation Systems. In Pedro R. D’Argenio & Hernán C. Melgratti, editors: CONCUR 2013 - Concurrency Theory - 24th International Conference, CONCUR 2013, Buenos Aires, Argentina, August 27-30, 2013. Proceedings, Lecture Notes in Computer Science 8052, Springer, pp. 470–484, 10.1007/978-3-642-40184-8_33.
- Sjoerd Cranen, Bas Luttik & Tim A. C. Willemse (2015): Evidence for Fixpoint Logic. In Stephan Kreutzer, editor: 24th EACSL Annual Conference on Computer Science Logic, CSL 2015, September 7-10, 2015, Berlin, Germany, LIPIcs 41, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp. 78–93, 10.4230/LIPICS.CSL.2015.78.
- Hugues Evrard (2020): Modeling the Raft Distributed Consensus Protocol in LNT. In Ansgar Fehnker & Hubert Garavel, editors: Proceedings of the 4th Workshop on Models for Formal Analysis of Real Systems, MARS@ETAPS 2020, Dublin, Ireland, April 26, 2020, EPTCS 316, pp. 15–39, 10.4204/EPTCS.316.2.
- Hubert Garavel, Frédéric Lang & Wendelin Serwe (2017): From LOTOS to LNT. In Joost-Pieter Katoen, Rom Langerak & Arend Rensink, editors: ModelEd, TestEd, TrustEd - Essays Dedicated to Ed Brinksma on the Occasion of His 60th Birthday, Lecture Notes in Computer Science 10500, Springer, pp. 3–26, 10.1007/978-3-319-68270-9_1.
- Jan Friso Groote & Mohammad Reza Mousavi (2014): Modeling and Analysis of Communicating Systems. MIT Press, 10.5555/2628007.
- Trans. Petri Nets Other Model. Concurr. 11, pp. 262–273, 10.1007/978-3-662-53401-4_12.
- Leslie Lamport (1998): The Part-Time Parliament. ACM Trans. Comput. Syst. 16(2), pp. 133–169, 10.1145/279227.279229.
- Leslie Lamport (2002): Specifying Systems, The TLA+ Language and Tools for Hardware and Software Engineers. Addison-Wesley, 10.5555/579617. Available at http://research.microsoft.com/users/lamport/tla/book.html.
- Maurice Laveaux, Wieger Wesselink & Tim A. C. Willemse (2022): On-The-Fly Solving for Symbolic Parity Games. In Dana Fisman & Grigore Rosu, editors: Tools and Algorithms for the Construction and Analysis of Systems - 28th International Conference, TACAS 2022, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022, Munich, Germany, April 2-7, 2022, Proceedings, Part II, Lecture Notes in Computer Science 13244, Springer, pp. 137–155, 10.1007/978-3-030-99527-0_8.
- Diego Ongaro (2014): Consensus: bridging theory and practice. Ph.D. thesis, Stanford University, USA, 10.5555/AAI28121474.
- Diego Ongaro & John K. Ousterhout (2014): In Search of an Understandable Consensus Algorithm. In Garth Gibson & Nickolai Zeldovich, editors: 2014 USENIX Annual Technical Conference, USENIX ATC ’14, Philadelphia, PA, USA, June 19-20, 2014, USENIX Association, pp. 305–319, 10.5555/2643634.2643666.
- Fred B. Schneider (1990): Implementing Fault-Tolerant Services Using the State Machine Approach: A Tutorial. ACM Comput. Surv. 22(4), pp. 299–319, 10.1145/98163.98167.
- CPP 2016 - Proceedings of the 5th ACM SIGPLAN Conference on Certified Programs and Proofs, co-located with POPL 2016, pp. 154–165, 10.1145/2854065.2854081.
Collections
Sign up for free to add this paper to one or more collections.