Formalising the optimised link state routing protocol

Ryan Barry, Rob van Glabbeek, Peter Höfner

    Research output: Contribution to journalConference articlepeer-review

    1 Citation (Scopus)


    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
    Pages (from-to)40-71
    Number of pages32
    JournalElectronic Proceedings in Theoretical Computer Science, EPTCS
    Publication statusPublished - 26 Apr 2020
    Event4th Workshop on Models for Formal Analysis of Real Systems, MARS 2020 - Dublin, Ireland
    Duration: 26 Apr 2020 → …


    Dive into the research topics of 'Formalising the optimised link state routing protocol'. Together they form a unique fingerprint.

    Cite this