A Formal Approach for Maintaining Forest Topologies in Dynamic Networks

Faten Fakhfakh 1 Mohamed Tounsi 2 Mohamed Mosbah 2 Ahmed Hadj Kacem 1 Dominique Méry 3, 4
1 REDCAD - Unité de Recherche en développement et contrôle d'applications distribuées
2 LaBRI - Laboratoire Bordelais de Recherche en Informatique
3 VERIDIS - Modeling and Verification of Distributed Algorithms and Systems
MPII - Max-Planck-Institut für Informatik, Inria Nancy - Grand Est, LORIA - FM - Department of Formal Methods
4 MOSEL - Proof-oriented development of computer-based systems
LORIA - FM - Department of Formal Methods
Abstract : In this paper, we focus on maintaining a forest of spanning trees in dynamic networks. In fact, we propose an approach based on two levels for specifying and proving distributed algorithms in a forest. The rst level allows us to control the dynamic structure of the network by triggering a maintenance operation when the forest is altered. To do so, we develop a for- mal pattern using the Event-B method, based on the refinement technique. The proposed pattern relies on the Dynamicity Aware-Graph Relabeling Sys- tems (DA-GRS) which is an existing model for building and maintaining a spanning forest in dynamic networks. It is based on evolving graphs as a powerful model to record the evolution of a network topology. The second level of our approach deals with distributed algorithms which can be applied to spanning trees of the forest. Through an example of a leader election algo- rithm, we illustrate our pattern. The proof statistics show that our solution can save efforts on specifying as well as proving the correctness of distributed algorithms in a forest topology.
Keywords : Dynamic networks Formal proof Forest maintenance
Type de document :
Communication dans un congrès
ICIS 2017 - 16th IEEE/ACIS International Conference on Computer and Information Science, May 2017, Wuhan, China. 719, pp.123-137, Studies in Computational Intelligence. 〈10.1007/978-3-319-60170-0_9〉
Liste complète des métadonnées
https://hal.archives-ouvertes.fr/hal-01495807
Contributeur : Mohamed Mosbah <>
Soumis le : dimanche 26 mars 2017 - 22:52:10
Dernière modification le : mardi 19 février 2019 - 15:40:04

Identifiants

Collections

UNIV-BORDEAUX | LABRI | INRIA | LORIA | LORIA-FM | UNIV-LORRAINE | INRIA2017

Citation

Faten Fakhfakh, Mohamed Tounsi, Mohamed Mosbah, Ahmed Hadj Kacem, Dominique Méry. A Formal Approach for Maintaining Forest Topologies in Dynamic Networks. ICIS 2017 - 16th IEEE/ACIS International Conference on Computer and Information Science, May 2017, Wuhan, China. 719, pp.123-137, Studies in Computational Intelligence. 〈10.1007/978-3-319-60170-0_9〉. 〈hal-01495807〉

Exporter

BibTeX TEI DC DCterms EndNote

Partager

Métriques

Consultations de la notice

310

Contact

support.ccsd.cnrs.fr
hal.support@ccsd.cnrs.fr
Logo CCSD