We present a heuristic to derive specifications of distributed systems by stepwise refinement. The heuristic is based upon a conditional refinement relation between specifications. It is applied to construct four sliding window protocols that provide reliable data transfer over unreliable communication channels. The protocols use modulo-N sequence numbers. They are less restrictive and easier to implement than sliding window protocols previously studied in the protocol verification literature.
CITATION STYLE
Shankar, A. U., & Lam, S. S. (1990). Construction of network protocols by stepwise refinement. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 430 LNCS, pp. 669–695). Springer Verlag. https://doi.org/10.1007/3-540-52559-9_83
Mendeley helps you to discover research relevant for your work.