Cultural advice

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

Aboriginal and Torres Strait Islander peoples are advised that ANU Library collections may include images, names, voices, and other representations of deceased persons.

Material in the collection may contain terms, language or views that reflect the period in which the item was created and may be considered inappropriate today.

Formal models of the OSPF routing protocol

Thumbnail Image

Date

2020

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

URI

http://hdl.handle.net/1885/311625

Collections

ANU Research Publications

Source

Electronic Proceedings in Theoretical Computer Science, EPTCS Proceedings of the 4th Workshop on Models for Formal Analysis of Real Systems (MARS 2020)

Type

Conference paper

Book Title

Entity type

Access Statement

Open Access

License Rights

DOI

10.4204/EPTCS.316.4

Restricted until

Downloads

File
Description
Formal Models of the OSPE Routing Protocol.pdf (1.56 MB)

DSpace software copyright © 2002-2026 LYRASIS

abcd