Skip to main content

A process algebra for link layer protocols

Authors

Peter Hoefner, Rob van Glabbeek and Michael Markl

DATA61

UNSW Sydney

Abstract

We propose a process algebra for link layer protocols, featuring a unique mechanism for modelling the collision of data packets. We also formalise suitable liveness properties for link layer protocols specified in this framework. To show applicability we model and analyse two versions of the Carrier-Sense Multiple Access with Collision Avoidance (CSMA/CA) protocol. Our analysis confirms the hidden station problem for the version without virtual carrier sensing. However, we also show that the version with virtual carrier sensing overcomes not only this problem, but also the exposed station problem with probability 1. Yet the protocol cannot guarantee packet delivery, not even with probability 1.

BibTeX Entry

  @inproceedings{Hoefner_GM_19,
    numpages         = {25},
    publisher        = {Springer},
    doi              = {https://doi.org/10.1007/978-3-030-17184-1\_24},
    booktitle        = {Proceedings of the 28th European Symposium on Programming},
    author           = {Hoefner, Peter and van Glabbeek, Rob and Markl, Michael},
    month            = apr,
    volume           = {11423},
    year             = {2019},
    date             = {2019-4-6},
    title            = {{A} Process Algebra for Link Layer Protocols},
    address          = {Prague, Czech Republic}
  }

Download