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

DOI10.1007/978-3-662-49498-1_5MaRDI QIDQ2802472zbMATHOpenAlexFDO

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)

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

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)

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.

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

Cites work

• scientific article; zbMATH DE number 3956423 (Why is no real title available?)
• scientific article; zbMATH DE number 4039251 (Why is no real title available?)
• scientific article; zbMATH DE number 4110131 (Why is no real title available?)
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• A Rule Format for Associativity
• A process algebra for timed systems
• A process algebra for wireless mesh networks
• A process calculus for mobile ad hoc networks
• A structural approach to operational semantics
• A timed process algebra for wireless networks with an application in routing (extended abstract)
• Discrete time process algebra
• Formal verification of standards for distance vector routing protocols
• Higher-level synchronising devices in Meije-SCCS
• Modelling and verifying the AODV routing protocol
• The algebra of timed processes, ATP: Theory and application

Cited in

(8)

• Analysing AWN-Specifications Using mCRL2 (Extended Abstract)
• A process algebra for link layer protocols
• A process algebra for wireless mesh networks
• Towards an algebra of routing tables
• Depletable channels: dynamics, behaviour, and efficiency in network design
• scientific article; zbMATH DE number 7449995 (Why is no real title available?)
• Modelling and verifying the AODV routing protocol
• A timed process algebra for wireless networks with an application in routing (extended abstract)

Describes a project that uses

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)