1. Verifying a sliding window protocol in µCRL
- Author
-
Fokkink, W.J., Groote, J.F., Pang, J., Badban, B., Pol, van de, J.C., Rattray, C., Maharaj, S., Shankland, C., and Formal System Analysis
- Subjects
Model checking ,Sequence ,Correctness ,Computer science ,Modulo ,Window (computing) ,Axiomatic system ,TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES ,TheoryofComputation_LOGICSANDMEANINGSOFPROGRAMS ,Computer Science::Logic in Computer Science ,Sliding window protocol ,Computer Science::Networking and Internet Architecture ,Algorithm ,Queue - Abstract
We prove the correctness of a sliding window protocol with an arbitrary finite window size n and sequence numbers modulo 2n. We show 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 was checked with the help of PVS.
- Published
- 2004
- Full Text
- View/download PDF