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.
Type de document :
Communication dans un congrès
Roberto Bruni; Juergen Dingel. 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. Springer, Lecture Notes in Computer Science, LNCS-6722, pp.213-227, 2011, Formal Techniques for Distributed Systems. 〈10.1007/978-3-642-21461-5_14〉
Liste complète des métadonnées

Littérature citée [15 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01583319
Contributeur : Hal Ifip <>
Soumis le : jeudi 7 septembre 2017 - 11:10:18
Dernière modification le : lundi 11 septembre 2017 - 10:47:20

Fichier

978-3-642-21461-5_14_Chapter.p...
Fichiers produits par l'(les) auteur(s)

Licence


Distributed under a Creative Commons Paternité 4.0 International License

Identifiants

Citation

Dimitrios Kouzapas, Anna Philippou. A Process Calculus for Dynamic Networks. Roberto Bruni; Juergen Dingel. 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. Springer, Lecture Notes in Computer Science, LNCS-6722, pp.213-227, 2011, Formal Techniques for Distributed Systems. 〈10.1007/978-3-642-21461-5_14〉. 〈hal-01583319〉

Partager

Métriques

Consultations de la notice

7