Performance evaluation of a consensus algorithm with Petri nets N. Sergent This paper is concerned with an application of Hierarchical Coloured Timed Petri Nets to the modelling and the performance evaluation of a distributed consensus algorithm. The asynchronous system model is augmented with Failure Suspectors, in order to overcome the impossibility of reaching consensus in the presence of crash failures. We have used a top down modular approach to manage the complexity of the considered layered protocols. The termination time of the consensus algorithm is mainly determined by the communications cost, i.e. by the timing characteristics of the network used for exchanging messages. In a simplified way, the network latency is taken into account in the system model. As the underlying network protocol we have considered UDP/IP. By simulating the consensus Petri net model, it is possible to obtain optimal values for the Failure Suspectors parameters. Furthermore, probabilistic guarantees on the termination time of consensus are provided.