A Process Algebra for Wireless Mesh Networks

DOI10.1007/978-3-642-28869-2_15zbMath1352.68183arXiv1512.07319OpenAlexW1483980066MaRDI QIDQ2892733

Marius Portmann, Peter Höfner, Ansgar Fehnker, Wee Lum Tan, Robert J. 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

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

Related Items (19)

Model checking mobile ad hoc networks ⋮ On Implementable Timed Automata ⋮ Mechanizing a process algebra for network protocols ⋮ Structure Preserving Bisimilarity, Supporting an Operational Petri Net Semantics of CCSP ⋮ Modelling and verifying the AODV routing protocol ⋮ Out for coffee: with Rob ⋮ Revisiting sequential composition in process calculi ⋮ Modeling and efficient verification of wireless ad hoc networks ⋮ Analysing AWN-Specifications Using mCRL2 (Extended Abstract) ⋮ A semantic theory of the Internet of things ⋮ Automatic construction of systems of distributed components from nested Petri nets models ⋮ Ensuring liveness properties of distributed systems: open problems ⋮ Unnamed Item ⋮ A calculus of branching processes ⋮ A Timed Process Algebra for Wireless Networks with an Application in Routing ⋮ The Expressive Power of Monotonic Parallel Composition ⋮ A tale of two graph models: a case study in wireless sensor networks ⋮ CCS: it's not fair! Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions ⋮ Analysis of mobile networks' protocols based on abstract state machine

Uses Software

• HOL/SPIN

This page was built for publication: A Process Algebra for Wireless Mesh Networks