Formalising the Optimised Link State Routing Protocol

Ryan Barry, R.J. van Glabbeek, P. Höfner

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract / Description of output

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.
Original languageEnglish
Title of host publicationProceedings of the 4th Workshop on Models for Formal Analysis of Real Systems, Ireland, April 26, 2020
EditorsA. Fehnker, H. Garavel
PublisherOpen Publishing Association
Pages40-71
Number of pages32
Volume316
DOIs
Publication statusPublished - 26 Apr 2020
Event4th Workshop on Models for Formal Analysis of Real Systems (MARS 2020) - Dublin, Ireland
Duration: 1 Sept 2020 → …
Conference number: 4
http://mars-workshop.org/mars2020/index.html#programme

Publication series

NameElectronic Proceedings in Theoretical Computer Science
PublisherOpen Publishing Association
ISSN (Electronic)2075-2180

Workshop

Workshop4th Workshop on Models for Formal Analysis of Real Systems (MARS 2020)
Abbreviated titleMARS 2020
Country/TerritoryIreland
CityDublin
Period1/09/20 → …
Internet address

Fingerprint

Dive into the research topics of 'Formalising the Optimised Link State Routing Protocol'. Together they form a unique fingerprint.

Cite this