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.

Formalising the optimised link state routing protocol

Thumbnail Image

Date

2020

Authors

Barry, Ryan
van Glabbeek, Rob
Hoefner, Peter

Journal Title

Journal ISSN

Volume Title

Publisher

Open Publishing Association

Abstract

Routing protocol specifications are traditionally written in plain English. Often this yields ambiguities, inaccuracies or even contradictions. Formal methods techniques, such as process algebras, avoid these problems, thus leading to more precise and verifiable descriptions of protocols. In this paper we use the timed process algebra T-AWN for modelling the Optimised Link State Routing protocol (OLSR) version 2.

Description

Keywords

Citation

URI

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

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.3

Restricted until

Downloads

File
Description
Formalising the Optimised Link State Routing Protocol.pdf (311.97 KB)

DSpace software copyright © 2002-2026 LYRASIS