% this should be the last package used \usepackage{pdfsetup}
% urls in roman style, theory text in math-similar italics \urlstyle{rm} \isabellestyle{rm}
\begin{document}
\title{Mechanization of the Algebra for Wireless Networks (AWN)} \author{Timothy Bourke\thanks{Inria, \'Ecole normale sup\'erieure, and
NICTA}} \maketitle
\begin{abstract}
AWN is a process algebra developed for modelling and analysing protocols for
Mobile Ad hoc Networks (MANETs) and Wireless Mesh Networks
(WMNs)~\cite[\textsection4]{FehnkerEtAl:AWN:2013}.
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 (\verb|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).
Further documentation is available in~\cite{BourkeEtAl:MechAWN:2014}.
Die Informationen auf dieser Webseite wurden
nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit,
noch Qualität der bereit gestellten Informationen zugesichert.
Bemerkung:
Die farbliche Syntaxdarstellung und die Messung sind noch experimentell.