Stepwise Development of Distributed Vertex Colouring Algorithms (Abstract)

Manamiary Bruno Andriamiarina 1 Dominique Méry 1
1 VERIDIS - VERIfication pour les systèmes DIStribués
Inria Nancy - Grand Est, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications : UMR7503
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.
Document type :
Preprints, Working Papers, ...
Liste complète des métadonnées

Cited literature [12 references]  Display  Hide  Download

https://hal.inria.fr/inria-00606201
Contributor : Manamiary Bruno Andriamiarina <>
Submitted on : Tuesday, July 5, 2011 - 4:25:40 PM
Last modification on : Thursday, February 21, 2019 - 2:02:02 PM
Document(s) archivé(s) le : Monday, November 12, 2012 - 10:10:57 AM

File

_MERY-ANDRIAMIARINA_Abstract_G...
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00606201, version 1

Collections

Citation

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

Share

Metrics

Record views

336

Files downloads

273