article · TU/e Research Portal (Eindhoven University of Technology) · 2004

Verifying a Sliding Window Protocol in µCRL

Fokkink, WJ Wan, Groote, JF Jan Friso, Pang, J, Badban, B, Pol, van de, JC Jaco

Cited by 0Abstract and details only

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.

Cite this paper

APA 7

Fokkink, W. W., Groote, J. J. F., Pang, J., Badban, B., & Pol, V. D. J. J. (2004). Verifying a Sliding Window Protocol in µCRL. TU/e Research Portal (Eindhoven University of Technology).

MLA 9

Fokkink, WJ Wan, et al. “Verifying a Sliding Window Protocol in µCRL.” TU/e Research Portal (Eindhoven University of Technology), 2004.

Chicago

Fokkink, WJ Wan, JF Jan Friso Groote, J Pang, B Badban, and van de, JC Jaco Pol. 2004. “Verifying a Sliding Window Protocol in µCRL.” TU/e Research Portal (Eindhoven University of Technology).

Harvard

Fokkink, W.W. et al. (2004) ‘Verifying a Sliding Window Protocol in µCRL’, TU/e Research Portal (Eindhoven University of Technology).

BibTeX

@article{fokkink2004verifying,
  title = {{Verifying a Sliding Window Protocol in µCRL}},
  author = {Fokkink, WJ Wan and Groote, JF Jan Friso and Pang, J and Badban, B and Pol, van de, JC Jaco},
  journal = {TU/e Research Portal (Eindhoven University of Technology)},
  year = {2004}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.