Formalising the optimised link state routing protocol

Ryan Barry; Rob van Glabbeek; Peter Höfner

doi:10.4204/EPTCS.316.3

Formalising the optimised link state routing protocol

Ryan Barry, Rob van Glabbeek, Peter Höfner

Research output: Contribution to journal › Conference article › peer-review

1 Citation (Scopus)

Abstract

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 language	English
Pages (from-to)	40-71
Number of pages	32
Journal	Electronic Proceedings in Theoretical Computer Science, EPTCS
Volume	316
DOIs	https://doi.org/10.4204/EPTCS.316.3
Publication status	Published - 26 Apr 2020
Event	4th Workshop on Models for Formal Analysis of Real Systems, MARS 2020 - Dublin, Ireland Duration: 26 Apr 2020 → …

Access to Document

10.4204/EPTCS.316.3

Cite this

@article{0337b629a542454e8716ae425c08220b,

title = "Formalising the optimised link state routing protocol",

abstract = "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.",

author = "Ryan Barry and {van Glabbeek}, Rob and Peter H{\"o}fner",

note = "Publisher Copyright: {\textcopyright} R. Barry, R.J. van Glabbeek & P. H{\"o}fner; 4th Workshop on Models for Formal Analysis of Real Systems, MARS 2020 ; Conference date: 26-04-2020",

year = "2020",

month = apr,

day = "26",

doi = "10.4204/EPTCS.316.3",

language = "English",

volume = "316",

pages = "40--71",

journal = "Electronic Proceedings in Theoretical Computer Science, EPTCS",

issn = "2075-2180",

publisher = "Open Publishing Association",

}

TY - JOUR

T1 - Formalising the optimised link state routing protocol

AU - Barry, Ryan

AU - van Glabbeek, Rob

AU - Höfner, Peter

N1 - Publisher Copyright: © R. Barry, R.J. van Glabbeek & P. Höfner

PY - 2020/4/26

Y1 - 2020/4/26

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85085679977&partnerID=8YFLogxK

U2 - 10.4204/EPTCS.316.3

DO - 10.4204/EPTCS.316.3

M3 - Conference article

AN - SCOPUS:85085679977

SN - 2075-2180

VL - 316

SP - 40

EP - 71

JO - Electronic Proceedings in Theoretical Computer Science, EPTCS

JF - Electronic Proceedings in Theoretical Computer Science, EPTCS

T2 - 4th Workshop on Models for Formal Analysis of Real Systems, MARS 2020

Y2 - 26 April 2020

ER -

Formalising the optimised link state routing protocol

Abstract

Access to Document

Other files and links

Fingerprint

Cite this