Formal models of the OSPF routing protocol
Loading...
Date
Authors
Drury, Jack
Hoefner, Peter
Wang, Weiyou
Journal Title
Journal ISSN
Volume Title
Publisher
Open Publishing Association
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.
Description
Keywords
Citation
Collections
Source
Electronic Proceedings in Theoretical Computer Science, EPTCS Proceedings of the 4th Workshop on Models for Formal Analysis of Real Systems (MARS 2020)
Type
Book Title
Entity type
Access Statement
Open Access
License Rights
Restricted until
Downloads
File
Description