Skip to Main content Skip to Navigation
Conference papers

A Process Calculus for Dynamic Networks

Abstract : In this paper we propose a process calculus framework for dynamic networks in which the network topology may change as computation proceeds. The proposed calculus allows one to abstract away from neighborhood-discovery computations and it contains features for broadcasting at multiple transmission ranges and for viewing networks at different levels of abstraction. We develop a theory of confluence for the calculus and we use the machinery developed towards the verification of a leader-election algorithm for mobile ad hoc networks.
Complete list of metadata

Cited literature [15 references]  Display  Hide  Download
Contributor : Hal Ifip Connect in order to contact the contributor
Submitted on : Thursday, September 7, 2017 - 11:10:18 AM
Last modification on : Tuesday, January 18, 2022 - 2:26:05 PM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License



Dimitrios Kouzapas, Anna Philippou. A Process Calculus for Dynamic Networks. 13th Conference on Formal Methods for Open Object-Based Distributed Systems (FMOODS) / 31th International Conference on FORmal TEchniques for Networked and Distributed Systems (FORTE), Jun 2011, Reykjavik,, Iceland. pp.213-227, ⟨10.1007/978-3-642-21461-5_14⟩. ⟨hal-01583319⟩



Record views


Files downloads