A timed process algebra for wireless networks with an application in routing (extended abstract)

DOI10.1007/978-3-662-49498-1_5zbMATH Open1335.68005arXiv1606.03663OpenAlexW2978663703MaRDI QIDQ2802472FDOQ2802472

Authors: Émile Brives-Cazes, Peter Höfner, Rob van Glabbeek 

Publication date: 26 April 2016

Published in: Programming Languages and Systems (Search for Journal in Brave)

Abstract: 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.

Full work available at URL: https://arxiv.org/abs/1606.03663

Recommendations

• A process algebra for wireless mesh networks
• Towards an algebra of routing tables
• A timed calculus for wireless systems
• Modelling and verifying the AODV routing protocol
• Process algebras for network communication

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Higher-level synchronising devices in Meije-SCCS
• A structural approach to operational semantics
• Title not available (Why is that?)
• Title not available (Why is that?)
• The algebra of timed processes, ATP: Theory and application
• A process algebra for timed systems
• A process algebra for wireless mesh networks
• Title not available (Why is that?)
• A process calculus for mobile ad hoc networks
• A timed process algebra for wireless networks with an application in routing (extended abstract)
• Modelling and verifying the AODV routing protocol
• Formal verification of standards for distance vector routing protocols
• A Rule Format for Associativity
• Discrete time process algebra
• Title not available (Why is that?)

Cited In (7)

• Analysing AWN-Specifications Using mCRL2 (Extended Abstract)
• Towards an algebra of routing tables
• Modelling and verifying the AODV routing protocol
• A process algebra for wireless mesh networks
• Title not available (Why is that?)
• A timed process algebra for wireless networks with an application in routing (extended abstract)
• Depletable channels: dynamics, behaviour, and efficiency in network design

Uses Software

• LOTOS
• HOL/SPIN
• Prover9
• Mace4

This page was built for publication: A timed process algebra for wireless networks with an application in routing (extended abstract)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2802472)