A Timed Process Algebra for Wireless Networks with an Application in Routing

Emile Bres, Rob van Glabbeek, Peter Höfner

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract / Description of output

This paper proposes a timed process algebra for wireless networks, an extension of the Algebra for Wireless Networks. It combines treatments of local broadcast, conditional unicast and data structures, which are essential features for the modelling of network protocols. In this framework we model and analyse the Ad hoc On-Demand Distance Vector routing protocol, and show that, contrary to claims in the literature, it fails to be loop free. We also present boundary conditions for a fix ensuring that the resulting protocol is indeed loop free.
Original languageEnglish
Title of host publicationProgramming Languages and Systems
Subtitle of host publication25th European Symposium on Programming, ESOP 2016, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2016, Eindhoven, The Netherlands, April 2-8, 2016, Proceedings
EditorsPeter Thiemann
Place of PublicationBerlin, Heidelberg
PublisherSpringer Berlin Heidelberg
Number of pages28
ISBN (Electronic)978-3-662-49498-1
ISBN (Print)978-3-662-49497-4
Publication statusPublished - 21 Mar 2016
Event25th European Symposium on Programming 2016
- Eindoven, Netherlands
Duration: 4 Apr 20167 Aug 2022
Conference number: 25

Publication series

NameLecture Notes in Computer Science
PublisherSpringer Berlin, Heidelberg
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Symposium25th European Symposium on Programming 2016
Abbreviated titleESOP 2016


Dive into the research topics of 'A Timed Process Algebra for Wireless Networks with an Application in Routing'. Together they form a unique fingerprint.

Cite this