Journal of Automated Reasoning

, Volume 56, Issue 3, pp 309–341

Mechanizing a Process Algebra for Network Protocols

  • Timothy Bourke
  • Robert J. van Glabbeek
  • Peter Höfner

DOI: 10.1007/s10817-015-9358-9

Cite this article as:
Bourke, T., van Glabbeek, R.J. & Höfner, P. J Autom Reasoning (2016) 56: 309. doi:10.1007/s10817-015-9358-9


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 compositional technique for lifting global invariants stated at the level of individual nodes to networks of nodes.


Interactive theorem proving Isabelle/HOL Process algebra Compositional invariant proofs Wireless Mesh Networks Mobile Ad hoc Networks 

Copyright information

© Springer Science+Business Media Dordrecht 2016

Authors and Affiliations

  1. 1.Inria Paris and École normale supérieureParisFrance
  2. 2.NICTA and UNSWSydneyAustralia

Personalised recommendations