Formal Modeling and Verification of a Distributed Algorithm for Constructing Maximal Cliques in Static Networks

• Autores: Faten Fakhfakh, Mohamed Tounsi, Mohamed Mosbah
• Localización: Computación y Sistemas (CyS), ISSN 1405-5546, ISSN-e 2007-9737, Vol. 23, Nº. 4, 2019, págs. 1417-1427
• Idioma: inglés
• Enlaces
  • Texto completo
• Resumen

  • Abstract Constructing maximal cliques is a well-known problem in the graph theory. Despite this problem has been well studied for decades, few efforts have been presented in distributed computing. The main contribution of this paper is to propose a distributed algorithm, modeled by local computations, for constructing all maximal and disjoint cliques in a static network. In order to prove the correctness of this algorithm, we use the formal Event-B method, which is based on the refinement technique. The latter consists in enriching a model in a step by step fashion. It is the foundation of the correct-by-construction approach which provides an easy way to prove algorithms.