Barry, Ryanvan Glabbeek, RobHoefner, Peter2024-01-19April 26 2http://hdl.handle.net/1885/311633Routing 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.application/pdfen-AU© 2020 Open Publishing Association202010.4204/EPTCS.316.32022-10-02