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.
Cite
@article{arxiv.2004.13286,
title = {Formal Models of the OSPF Routing Protocol},
author = {Jack Drury and Peter Höfner and Weiyou Wang},
journal= {arXiv preprint arXiv:2004.13286},
year = {2020}
}