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

DOI10.1007/978-3-662-49498-1_5zbMath1335.68005arXiv1606.03663OpenAlexW2978663703MaRDI QIDQ2802472

Peter Höfner, Émile Brives-Cazes, Robert J. 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)

Related Items (5)

Modelling and verifying the AODV routing protocol ⋮ Depletable channels: dynamics, behaviour, and efficiency in network design ⋮ Analysing AWN-Specifications Using mCRL2 (Extended Abstract) ⋮ Unnamed Item ⋮ A Timed Process Algebra for Wireless Networks with an Application in Routing

Uses Software

• LOTOS
• HOL/SPIN
• Prover9
• Mace4

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Modelling and verifying the AODV routing protocol
• A process calculus for mobile ad hoc networks
• Higher-level synchronising devices in Meije-SCCS
• The algebra of timed processes, ATP: Theory and application
• A structural approach to operational semantics
• A process algebra for timed systems
• Discrete time process algebra
• A Timed Process Algebra for Wireless Networks with an Application in Routing
• A Process Algebra for Wireless Mesh Networks
• Formal verification of standards for distance vector routing protocols
• A Rule Format for Associativity

This page was built for publication: A Timed Process Algebra for Wireless Networks with an Application in Routing