Download PDFOpen PDF in browserFormal Development of Distributed Enumeration Algorithms By Refinement-Based Techniques11 pages•Published: March 26, 2017AbstractThe 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 approachthat can be supported by an incremental process controlled by the refinement of models. Event-B modelling language is supporting our methodological. 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. Keyphrases: correct by construction, distributed algorithm, enumeration problem, event b, local computations In: Mohamed Mosbah and Michael Rusinowitch (editors). SCSS 2017. The 8th International Symposium on Symbolic Computation in Software Science 2017, vol 45, pages 96-106.
|