Formal Techniques for Distributed Systems pp 216-223
On Efficient Models for Model Checking Message-Passing Distributed Protocols
- Cite this paper as:
- Bokor P., Serafini M., Suri N. (2010) On Efficient Models for Model Checking Message-Passing Distributed Protocols. In: Hatcliff J., Zucca E. (eds) Formal Techniques for Distributed Systems. Lecture Notes in Computer Science, vol 6117. Springer, Berlin, Heidelberg
The complexity of distributed algorithms, such as state machine replication, motivates the use of formal methods to assist correctness verification. The design of the formal model of an algorithm directly affects the efficiency of the analysis. Therefore, it is desirable that this model does not add “unnecessary” complexity to the analysis. In this paper, we consider a general message-passing (MP) model of distributed algorithms and compare different ways of modeling the message traffic. We prove that the different MP models are equivalent with respect to the common properties of distributed algorithms. Therefore, one can select the model which is best suited for the applied verification technique.
We consider MP models which differ regarding whether (1) the event of message delivery can be interleaved with other events and (2) a computation event must consume all messages that have been delivered after the last computation event of the same process. For generalized MP distributed protocols and especially focusing on fault-tolerance, we show that our proposed model (without interleaved delivery events and with relaxed semantics of computation events) is significantly more efficient for explicit state model checking. For example, the model size of the Paxos algorithm is 1/13th that of existing equivalent MP models.