Formal Models of the OSPF Routing Protocol
arXiv:2004.13286 · doi:10.4204/EPTCS.316.4
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 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.
arXiv commentIn Proceedings MARS 2020, arXiv:2004.12403
References in corpus (6)
- A Process Algebra for Wireless Mesh Networks
- Automated Analysis of AODV using UPPAAL
- Modelling and Verifying the AODV Routing Protocol
- A Process Algebra for Wireless Mesh Networks used for Modelling, Verifying and Analysing AODV
- Sequence Numbers Do Not Guarantee Loop Freedom; AODV Can Yield Routing Loops
- Split, Send, Reassemble: A Formal Specification of a CAN Bus Protocol Stack