Graph- versus Vector-Based Analysis of a Consensus Protocol

Giorgio Delzanno
(University of Genoa)
Arend Rensink
(University of Twente)
Riccardo Traverso
(University of Genoa / FBK-irst)

The Paxos distributed consensus algorithm is a challenging case-study for standard, vector-based model checking techniques. Due to asynchronous communication, exhaustive analysis may generate very large state spaces already for small model instances. In this paper, we show the advantages of graph transformation as an alternative modelling technique. We model Paxos in a rich declarative transformation language, featuring (among other things) nested quantifiers, and we validate our model using the GROOVE model checker, a graph-based tool that exploits isomorphism as a natural way to prune the state space via symmetry reductions. We compare the results with those obtained by the standard model checker Spin on the basis of a vector-based encoding of the algorithm.

In Dragan Bošnački, Stefan Edelkamp, Alberto Lluch Lafuente and Anton Wijs: Proceedings 3rd Workshop on GRAPH Inspection and Traversal Engineering (GRAPHITE 2014), Grenoble, France, 5th April 2014, Electronic Proceedings in Theoretical Computer Science 159, pp. 44–57.
Published: 29th July 2014.

ArXived at: http://dx.doi.org/10.4204/EPTCS.159.5 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org