Mechanization of the Algebra for Wireless Networks (AWN) - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Other Publications Year : 2014

Mechanization of the Algebra for Wireless Networks (AWN)


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).
Fichier principal
Vignette du fichier
document.pdf (589.2 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01104031 , version 1 (15-01-2015)


  • HAL Id : hal-01104031 , version 1


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


Gmail Facebook X LinkedIn More