Formal models of the OSPF routing protocol
Authors
DATA61
UNSW Sydney
Australian National University
Abstract
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
@inproceedings{Drury_HW_20, address = {Dublin, Ireland}, author = {Drury, Jack and H\"{o}fner, Peter and Wang, Weiyou}, booktitle = {MARS2020}, date = {2020-4-26}, month = apr, pages = {72--120}, paperurl = {https://trustworthy.systems/publications/full_text/Drury_HW_20.pdf}, publisher = {EPTCS}, title = {Formal models of the {OSPF} routing protocol}, year = {2020} }