A process algebra for wireless mesh networks

DOI10.1007/978-3-642-28869-2_15MaRDI QIDQ2892733zbMATH OpenOpenAlexFDO

Authors Ansgar Fehnker, Peter Höfner, Marius Portmann, Wee Lum Tan, Rob van Glabbeek, Annabelle McIver

Publication date 22 June 2012

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

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

Mathematics Subject Classification ID

Network protocols (68M12) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Abstract: We propose a process algebra for wireless mesh networks that combines novel treatments of local broadcast, conditional unicast and data structures. In this framework, we model the Ad-hoc On-Demand Distance Vector (AODV) routing protocol and (dis)prove crucial properties such as loop freedom and packet delivery.

Recommendations

• A timed process algebra for wireless networks with an application in routing (extended abstract)
• Towards an algebra of routing tables
• A process calculus for mobile ad hoc networks
• Modelling and verifying the AODV routing protocol
• Modelling probabilistic wireless networks

Cited in

(29)

• Modeling and efficient verification of wireless ad hoc networks
• A semantic theory of the Internet of Things
• Ensuring liveness properties of distributed systems: open problems
• A tale of two graph models: a case study in wireless sensor networks
• Analysis of mobile networks' protocols based on abstract state machine
• Out for coffee: with Rob
• Automatic construction of systems of distributed components from nested Petri nets models
• A calculus of branching processes
• CCS: it's not fair! Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions
• Model checking mobile ad hoc networks
• A timed process algebra for wireless networks with an application in routing (extended abstract)
• The expressive power of monotonic parallel composition
• Modelling probabilistic wireless networks
• \textsf{Tarzan}: communicating and moving in wireless jungles
• Mechanizing a process algebra for network protocols
• Showing invariance compositionally for a process algebra for network protocols
• Towards an algebra of routing tables
• Modelling and verifying the AODV routing protocol
• Equational reasoning on ad hoc networks
• Structure preserving bisimilarity, supporting an operational Petri net semantics of CCSP
• A mechanized proof of loop freedom of the (untimed) AODV routing protocol
• Equational reasonings in wireless network gossip protocols
• On implementable timed automata
• A process algebra for link layer protocols
• Analysing AWN-Specifications Using mCRL2 (Extended Abstract)
• Imperative process algebra and models of parallel computation
• Store locally, prove globally
• Formal methods for mobile ad hoc networks: a survey
• Revisiting sequential composition in process calculi

Describes a project that uses

Uses Software

• HOL/SPIN

This page was built for publication: A process algebra for wireless mesh networks

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