Formalising the Optimised Link State Routing Protocol

Ryan Barry
Rob van Glabbeek
Peter Höfner

Routing protocol specifications are traditionally written in plain English. Often this yields ambiguities, inaccuracies or even contradictions. Formal methods techniques, such as process algebras, avoid these problems, thus leading to more precise and verifiable descriptions of protocols. In this paper we use the timed process algebra T-AWN for modelling the Optimised Link State Routing protocol (OLSR) version 2.

In Ansgar Fehnker and Hubert Garavel: Proceedings of the 4th Workshop on Models for Formal Analysis of Real Systems (MARS 2020), Dublin, Ireland, April 26, 2020, Electronic Proceedings in Theoretical Computer Science 316, pp. 40–71.
Published: 26th April 2020.

ArXived at: https://dx.doi.org/10.4204/EPTCS.316.3 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org