Stepwise Development of Distributed Vertex Colouring Algorithms (Abstract)

Manamiary Bruno Andriamiarina 1, 2 Dominique Méry 1
1 MOSEL - Proof-oriented development of computer-based systems
LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
2 VERIDIS - Modeling and Verification of Distributed Algorithms and Systems
Inria Nancy - Grand Est, LORIA - FM - Department of Formal Methods
Abstract : Verifying distributed algorithms is non trivial. A promising methodology is based on the Event B language and the refinement process : it consists in redeveloping the algorithms by targeting a collection of required properties, using the refinement of models which preserves the properties of an abstract one in concrete ones. This approach has already been followed by Abrial et al for their work on the IEEE 1394 protocol. Our goal is to integrate probabilities into this approach. It appears that there are other proposals for dealing with this problem. This paper presents an illustration of our approach through the study of vertex coloring algorithms, based on an algorithm cited by Métiver et al, and preliminary elements of a global methodology on realistic distributed algorithms.
Type de document :
Pré-publication, Document de travail
Liste complète des métadonnées

Littérature citée [12 références]  Voir  Masquer  Télécharger
Contributeur : Manamiary Bruno Andriamiarina <>
Soumis le : mardi 5 juillet 2011 - 16:25:40
Dernière modification le : mardi 18 décembre 2018 - 16:38:25
Document(s) archivé(s) le : lundi 12 novembre 2012 - 10:10:57


Fichiers produits par l'(les) auteur(s)


  • HAL Id : inria-00606201, version 1



Manamiary Bruno Andriamiarina, Dominique Méry. Stepwise Development of Distributed Vertex Colouring Algorithms (Abstract). 2011. 〈inria-00606201〉



Consultations de la notice


Téléchargements de fichiers