Formal models of the OSPF routing protocol

Jack Drury, Peter Höfner, Weiyou Wang

    Research output: Contribution to journalConference articlepeer-review

    2 Citations (Scopus)


    We present three formal models of the OSPF routing protocol. The first two are formalised in the timed process algebra T-AWN, which is not only tailored to routing protocols, but also specifies protocols in pseudo-code that is easily readable. The difference between the two models lies in the level of detail (level of abstraction). From the more abstract model we then generate the third model. It is based on networks of timed automata and can be executed in the model checker Uppaal.

    Original languageEnglish
    Pages (from-to)72-120
    Number of pages49
    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 'Formal models of the OSPF routing protocol'. Together they form a unique fingerprint.

    Cite this