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 metadatas

Cited literature [15 references]  Display  Hide  Download

https://hal.inria.fr/hal-01583319
Contributor : Hal Ifip <>
Submitted on : Thursday, September 7, 2017 - 11:10:18 AM
Last modification on : Monday, September 11, 2017 - 10:47:20 AM

File

978-3-642-21461-5_14_Chapter.p...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

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⟩

Share

Metrics

Record views

74

Files downloads

93