CaltechAUTHORS
  A Caltech Library Service

The Sliding Window Protocol Revisited

Van de Snepscheut, Jan L. A. (1991) The Sliding Window Protocol Revisited. California Institute of Technology . (Unpublished) http://resolver.caltech.edu/CaltechCSTR:1991.cs-tr-91-06

[img]
Preview
Postscript
See Usage Policy.

123Kb
[img]
Preview
PDF
See Usage Policy.

370Kb

Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechCSTR:1991.cs-tr-91-06

Abstract

We give a correctness proof of the sliding window protocol. Both safety and liveness properties are addressed. We show how faulty channels can be represented as nondeterministic programs. The correctness proof is given as a sequence of correctness-preserving transformations of a sequential program that satisfies the original specification, with the exception that it does not have any faulty channels. We work as long as possible with a sequential program, although the transformation steps are guided by the aim of going to a distributed program. The final transformation steps consist in distributing the actions of the sequential program over a number of processes.


Item Type:Report or Paper (Technical Report)
Group:Computer Science Technical Reports
Record Number:CaltechCSTR:1991.cs-tr-91-06
Persistent URL:http://resolver.caltech.edu/CaltechCSTR:1991.cs-tr-91-06
Usage Policy:You are granted permission for individual, educational, research and non-commercial reproduction, distribution, display and performance of this work in any format.
ID Code:26738
Collection:CaltechCSTR
Deposited By: Imported from CaltechCSTR
Deposited On:25 Apr 2001
Last Modified:26 Dec 2012 14:03

Repository Staff Only: item control page