Advertisement

Formal Aspects of Computing

, Volume 17, Issue 3, pp 342–388 | Cite as

Verification of a sliding window protocol in μCRL and PVS

  • Bahareh Badban
  • Wan Fokkink
  • Jan Friso Groote
  • Jun Pang
  • Jaco van de Pol
Article

Abstract

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 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© BCS 2005

Authors and Affiliations

  • Bahareh Badban
    • 1
  • Wan Fokkink
    • 1
    • 4
  • Jan Friso Groote
    • 1
    • 3
  • Jun Pang
    • 2
  • Jaco van de Pol
    • 1
    • 3
  1. 1.Department of Software EngineeringCWIAmsterdamThe Netherlands
  2. 2.École PolytechniqueINRIA Futurs and LIXPalaiseau CedexFrance
  3. 3.Department of Computer ScienceEindhoven University of TechnologyEindhovenThe Netherlands
  4. 4.Department of Theoretical Computer ScienceVrije Universiteit AmsterdamAmsterdamThe Netherlands

Personalised recommendations