Skip to Main content Skip to Navigation
Journal articles

Mechanizing a Process Algebra for Network Protocols

Timothy Bourke 1, 2 Robert J van Glabbeek 3, 4 Peter Höfner 3, 4 
2 Parkas - Parallélisme de Kahn Synchrone
DI-ENS - Département d'informatique - ENS Paris, CNRS - Centre National de la Recherche Scientifique, Inria de Paris
Abstract : 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.
Complete list of metadata

Cited literature [38 references]  Display  Hide  Download
Contributor : Timothy Bourke Connect in order to contact the contributor
Submitted on : Saturday, December 3, 2016 - 4:44:39 PM
Last modification on : Friday, July 8, 2022 - 10:09:16 AM
Long-term archiving on: : Thursday, March 23, 2017 - 12:32:22 AM


Files produced by the author(s)




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



Record views


Files downloads