Skip to main content

Formal models of the OSPF routing protocol


Jack Drury, Peter Hoefner and Weiyou Wang


UNSW Sydney

Australian National University


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

BibTeX Entry

    year             = {2020},
    month            = apr,
    pages            = {72--120},
    publisher        = {EPTCS},
    paperurl         = {},
    booktitle        = {MARS2020},
    author           = {Drury, Jack and Hoefner, Peter and Wang, Weiyou},
    address          = {Dublin, Ireland},
    title            = {Formal models of the {OSPF} routing protocol},
    date             = {2020-4-26}