A Process Calculus for Dynamic Networks - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2011

A Process Calculus for Dynamic Networks

Dimitrios Kouzapas
  • Function : Author
  • PersonId : 1015711
Anna Philippou
  • Function : Author
  • PersonId : 1015712


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.
Fichier principal
Vignette du fichier
978-3-642-21461-5_14_Chapter.pdf (144.04 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01583319 , version 1 (07-09-2017)





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⟩
27 View
64 Download



Gmail Facebook Twitter LinkedIn More