EEMCS

Full text available as:

PDF (Author version, camera ready) - Univ. of Twente only - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader 287 Kb

Official URL: http://dx.doi.org/10.3233/978-1-58603-907-3-179

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 muCRL. We use the theorem prover PVS to formalize
and to mechanically prove the correctness. This implies both
safety and liveness (under the assumption of fairness).

Export this item as:

• BibTeX
• XML

To request a copy of the PDF please email us request copy

To correct this item please ask your editor

Repository Staff Only: edit this item