SciELO - Scientific Electronic Library Online

vol.21 issue4How the Accuracy and Computational Cost of Spiking Neuron Simulation are Affected by the Time Span and Firing RateRemedies for the Inconsistences in the Times of Execution of the Unsorted Database Search Algorithm within the Wave Approach author indexsubject indexsearch form
Home Pagealphabetic serial listing  

Services on Demand




Related links

  • Have no similar articlesSimilars in SciELO


Computación y Sistemas

Print version ISSN 1405-5546


FAKHFAKH, Faten et al. Proving Distributed Coloring of Forests in Dynamic Networks. Comp. y Sist. [online]. 2017, vol.21, n.4, pp.863-881. ISSN 1405-5546.

The design and the proof of correctness of distributed algorithms in dynamic networks are difficult tasks. These networks are characterized by frequent topology changes due to unpredictable appearance and disappearance of mobile devices and/or communication links. In this paper, we propose a correct-by-construction approach for specifying and proving distributed algorithms in a forest topology. In the first stage, we specify a formal pattern using the Event-B method, based on the refinement technique. The proposed pattern relies on the Dynamicity Aware-Graph Relabeling Systems (DA-GRS) which is an existing model for building and maintaining a forest of spanning trees in dynamic networks. It is based on evolving graphs as a powerful model to record the evolution of a network topology. In the second stage, we deal with distributed algorithms which can be applied to spanning trees of the forest. In fact, we use the proposed pattern to specify a tree-coloring algorithm. The proof statistics comparing the development of this algorithm with and without using the pattern show the efficiency of our solution in terms of proofs reduction.

Keywords : Distributed algorithms; dynamic networks; forest; formal pattern; event-B method; coloring.

        · text in English     · English ( pdf )