Formal Development of Distributed Enumeration Algorithms By Refinement-Based Techniques

The enumeration problem addresses a collection of important algorithmic issues related to distributed computations. Among existing solutions, we are interested on the seminal algorithm of Mazurkiewicz, based on local computations. Our paper contributes to the design of a correct-by-construction enumeration algorithm. The main idea relies upon the development of the problem following a top/down approach that can be supported by an incremental process controlled by the refinement of models. Event-B modelling language is supporting our methodology. Our main objective is to provide a verified component for distributed enumeration in order to be used and extended for solving other problems of distributed algorithms.

[1]  Ralph-Johan Back,et al.  A calculus of refinements for program derivations , 1988, Acta Informatica.

[2]  Dominique Méry,et al.  Electronic Communications of the EASST Volume 35 ( 2010 ) Proceedings of the 10 th International Workshop on Automated Verification of Critical Systems ( AVoCS 2010 ) Proving Distributed Algorithms by Combining Refinement and Local Computations , 2011 .

[3]  Thai Son Hoang,et al.  Rodin: an open toolset for modelling and reasoning in Event-B , 2010, International Journal on Software Tools for Technology Transfer.

[4]  Dominique Méry,et al.  Refinement-Based Guidelines for Algorithmic Systems , 2009, Int. J. Softw. Informatics.

[5]  Dominique Méry,et al.  Analysis of DSR Protocol in Event-B , 2011, SSS.

[6]  Sebastiano Vigna,et al.  An Effective Characterization of Computability in Anonymous Networks , 2001, DISC.

[7]  Dana Angluin,et al.  Local and global properties in networks of processors (Extended Abstract) , 1980, STOC '80.

[8]  Yves Métivier,et al.  On Snapshots and Stable Properties Detection in Anonymous Fully Distributed Systems (Extended Abstract) , 2012, SIROCCO.

[9]  Dominique Méry,et al.  Revisiting Snapshot Algorithms by Refinement-Based Techniques , 2012, 2012 13th International Conference on Parallel and Distributed Computing, Applications and Technologies.

[10]  Antoni W. Mazurkiewicz.  Distributed Enumeration , 1997, Inf. Process. Lett..

[11]  Yves Métivier,et al.  Election in partially anonymous networks with arbitrary knowledge in message passing systems , 2012, Distributed Computing.

[12]  Jean-Raymond Abrial,et al.  Modeling in event-b - system and software engineering by Jean-Raymond Abrial , 2010, SOEN.

[13]  Brahim Hamid,et al.  A Local Enumeration Protocol in Spite of Corrupted Data , 2006, J. Comput..

[14]  Yves Métivier,et al.  Graph relabelling systems and distributed algorithms , 1999 .

[15]  Gerard Tel,et al.  Introduction to Distributed Algorithms: Contents , 2000 .