In:
Formal Aspects of Computing, Association for Computing Machinery (ACM), Vol. 17, No. 3 ( 2005-10), p. 342-388
Abstract:
We prove the correctness of a sliding window protocol with an arbitrary finite window size n and sequence numbers modulo 2 n . The correctness consists of showing that the sliding window protocol is branching bisimilar to a queue of capacity 2 n . The proof is given entirely on the basis of an axiomatic theory, and has been checked in the theorem prover PVS.
Type of Medium:
Online Resource
ISSN:
0934-5043
,
1433-299X
DOI:
10.1007/s00165-005-0070-0
Language:
English
Publisher:
Association for Computing Machinery (ACM)
Publication Date:
2005
detail.hit.zdb_id:
1476364-3
Permalink