Mechanical Verification of a Two-Way Sliding Window Protocol

Abstract. We prove the correctness of a two-way sliding window protocol with piggybacking, where the acknowledgments of the latest received data are attached to the next data transmitted back into the channel. The window size of both parties are considered to be finite, though they can be of different sizes. We show that this protocol is equivalent (branching bisimilar) to a pair of FIFO queues of finite capacities. The protocol is first modeled and manually proved for its correctness in the process algebraic language of

• Type: Conference
• Year: 2008
• Where: WOTUG
• Authors: Bahareh Badban, Wan Fokkink, Jaco van de Pol
• Keywords: Computer Science, Fifo Queues, Sliding Window Protocol, Two-way Sliding Window, WOTUG 2008