Verification of a sliding window protocol in μCRL and PVS
- 60 Downloads
We prove the correctness of a sliding window protocol with an arbitrary finite window size n and sequence numbers modulo 2n. The correctness consists of showing that the sliding window protocol is branching bisimilar to a queue of capacity 2n. The proof is given entirely on the basis of an axiomatic theory, and has been checked in the theorem prover PVS.
KeywordsμCRL Branching bisimulation Process algebra Sliding window protocols Specification Verification techniques
Unable to display preview. Download preview PDF.