Mechanizing a Process Algebra for Network Protocols - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Journal of Automated Reasoning Year : 2016

Mechanizing a Process Algebra for Network Protocols


This paper presents the mechanization of a process algebra for Mobile Ad hoc Networks and Wireless Mesh Networks, and the development of a compositional framework for proving invariant properties. Mechanizing the core process algebra in Isabelle/HOL is relatively standard, but its layered structure necessitates special treatment. The control states of reactive processes, such as nodes in a network, are modelled by terms of the process algebra. We propose a technique based on these terms to streamline proofs of inductive invariance. This is not sufficient, however, to state and prove invariants that relate states across multiple processes (entire networks). To this end, we propose a novel composi-tional technique for lifting global invariants stated at the level of individual nodes to networks of nodes.
Fichier principal
Vignette du fichier
final.pdf (597.74 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01408217 , version 1 (03-12-2016)



Timothy Bourke, Robert J van Glabbeek, Peter Höfner. Mechanizing a Process Algebra for Network Protocols. Journal of Automated Reasoning, 2016, 56, pp.309-341. ⟨10.1007/s10817-015-9358-9⟩. ⟨hal-01408217⟩
303 View
152 Download



Gmail Facebook Twitter LinkedIn More