Skip to Main content Skip to Navigation
Other publications

Mechanization of the Algebra for Wireless Networks (AWN)

Timothy Bourke 1, 2, 3
3 Parkas - Parallélisme de Kahn Synchrone
CNRS - Centre National de la Recherche Scientifique : UMR 8548, Inria Paris-Rocquencourt, DI-ENS - Département d'informatique de l'École normale supérieure
Abstract : AWN is a process algebra developed for modelling and analysing protocols for Mobile Ad hoc Networks (MANETs) and Wireless Mesh Networks (WMNs). AWN models comprise five distinct layers: sequential processes, local parallel compositions, nodes, partial networks, and complete networks. This development mechanises the original operational semantics of AWN and introduces a variant 'open' operational semantics that enables the compositional statement and proof of invariants across distinct network nodes. It supports labels (for weakening invariants) and (abstract) data state manipulations. A framework for compositional invariant proofs is developed, including a tactic (inv_cterms) for inductive invariant proofs of sequential processes, lifting rules for the open versions of the higher layers, and a rule for transferring lifted properties back to the standard semantics. A notion of 'control terms' reduces proof obligations to the subset of subterms that act directly (in contrast to operators for combining terms and joining processes).
Complete list of metadata

Cited literature [2 references]  Display  Hide  Download
Contributor : Timothy Bourke <>
Submitted on : Thursday, January 15, 2015 - 8:32:20 PM
Last modification on : Tuesday, September 22, 2020 - 3:47:17 AM
Long-term archiving on: : Friday, September 11, 2015 - 6:53:17 AM


Files produced by the author(s)


  • HAL Id : hal-01104031, version 1



Timothy Bourke. Mechanization of the Algebra for Wireless Networks (AWN). 2014, pp.186. ⟨hal-01104031⟩



Record views


Files downloads