Proving the Bounded Retransmission Protocol in the Pi-calculus

Thérèse Hardin (1) , Brahim Mammass (1)

1 SPI - Sémantiques, preuves et implantation

The aim of this paper is twofold. We first present a correctness proof of the Bounded Retransmission Protocol (BRP) done quite straightforwardly by bisimulation in the Pi-calculus. To our knowledge, it is the biggest proof realized in this framework. Then, we compare in depth several works on this protocol, focusing on how the used formalism influences implementation choices and proof techniques.

Domaines: Informatique [cs]

Thérèse Hardin, Brahim Mammass. Proving the Bounded Retransmission Protocol in the Pi-calculus. INFINITY'98 - 3rd International Workshop on Verification of Infinite State Systems, Jul 1998, Aalborg, Denmark. pp.68-80. ⟨hal-01622302⟩