Skip to main content
SpringerLink
Log in

Verification of a sliding window protocol in μCRL and PVS

  • Published:
Formal Aspects of Computing

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Department of Software Engineering, CWI, PO Box 94079, 1090, GB, Amsterdam, The Netherlands

    Bahareh Badban, Wan Fokkink, Jan Friso Groote & Jaco van de Pol

  2. École Polytechnique, INRIA Futurs and LIX, Rue de Saclay, 91128, Palaiseau Cedex, France

    Jun Pang

  3. Department of Computer Science, Eindhoven University of Technology, PO Box 513, 5600, MB, Eindhoven, The Netherlands

    Jan Friso Groote & Jaco van de Pol

  4. Department of Theoretical Computer Science, Vrije Universiteit Amsterdam, De Boelelaan 1081a, 1081, HV, Amsterdam, The Netherlands

    Wan Fokkink

Authors
  1. Bahareh Badban
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wan Fokkink
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jan Friso Groote
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Jun Pang
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Jaco van de Pol
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Wan Fokkink.

Additional information

Received November 2004

Revised June 2005

Accepted July 2005 by J. V. Tucker

Rights and permissions

Reprints and permissions

About this article

Cite this article

Badban, B., Fokkink, W., Groote, J. et al. Verification of a sliding window protocol in μCRL and PVS. Form Asp Comp 17, 342–388 (2005). https://doi.org/10.1007/s00165-005-0070-0

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00165-005-0070-0

Keywords

Search

Navigation