Download PDFOpen PDF in browser

Formal Development of Distributed Enumeration Algorithms By Refinement-Based Techniques

11 pagesPublished: March 26, 2017

Abstract

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 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

Links:
BibTeX entry
@inproceedings{SCSS2017:Formal_Development_of_Distributed,
  author    = {Maha Boussabbeh and Mohamed Tounsi and Ahmed Hadj Kacem and Mohamed Mosbah},
  title     = { Formal Development of Distributed Enumeration Algorithms By Refinement-Based Techniques},
  booktitle = {SCSS 2017. The 8th International Symposium on Symbolic Computation in Software Science 2017},
  editor    = {Mohamed Mosbah and Michael Rusinowitch},
  series    = {EPiC Series in Computing},
  volume    = {45},
  pages     = {96--106},
  year      = {2017},
  publisher = {EasyChair},
  bibsource = {EasyChair, http://www.easychair.org},
  issn      = {2398-7340},
  url       = {https://easychair.org/publications/paper/8Pls},
  doi       = {10.29007/8n75}}
Download PDFOpen PDF in browser