<?xml version="1.0" encoding="ISO-8859-1"?><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<front>
<journal-meta>
<journal-id>1405-5546</journal-id>
<journal-title><![CDATA[Computación y Sistemas]]></journal-title>
<abbrev-journal-title><![CDATA[Comp. y Sist.]]></abbrev-journal-title>
<issn>1405-5546</issn>
<publisher>
<publisher-name><![CDATA[Instituto Politécnico Nacional, Centro de Investigación en Computación]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S1405-55462017000400863</article-id>
<article-id pub-id-type="doi">10.13053/cys-21-4-2857</article-id>
<title-group>
<article-title xml:lang="en"><![CDATA[Proving Distributed Coloring of Forests in Dynamic Networks]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Fakhfakh]]></surname>
<given-names><![CDATA[Faten]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Tounsi]]></surname>
<given-names><![CDATA[Mohamed]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Mosbah]]></surname>
<given-names><![CDATA[Mohamed]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Méry]]></surname>
<given-names><![CDATA[Dominique]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Kacem]]></surname>
<given-names><![CDATA[Ahmed Hadj]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,University of Sfax  ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Tunisia</country>
</aff>
<aff id="Af2">
<institution><![CDATA[,University of Bordeaux  ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>France</country>
</aff>
<aff id="Af3">
<institution><![CDATA[,University of Lorrain  ]]></institution>
<addr-line><![CDATA[Nancy ]]></addr-line>
<country>France</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>12</month>
<year>2017</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>12</month>
<year>2017</year>
</pub-date>
<volume>21</volume>
<numero>4</numero>
<fpage>863</fpage>
<lpage>881</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_arttext&amp;pid=S1405-55462017000400863&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_abstract&amp;pid=S1405-55462017000400863&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_pdf&amp;pid=S1405-55462017000400863&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="en"><p><![CDATA[Abstract: The design and the proof of correctness of distributed algorithms in dynamic networks are difficult tasks. These networks are characterized by frequent topology changes due to unpredictable appearance and disappearance of mobile devices and/or communication links. In this paper, we propose a correct-by-construction approach for specifying and proving distributed algorithms in a forest topology. In the first stage, we specify a formal pattern using the Event-B method, based on the refinement technique. The proposed pattern relies on the Dynamicity Aware-Graph Relabeling Systems (DA-GRS) which is an existing model for building and maintaining a forest of spanning trees in dynamic networks. It is based on evolving graphs as a powerful model to record the evolution of a network topology. In the second stage, we deal with distributed algorithms which can be applied to spanning trees of the forest. In fact, we use the proposed pattern to specify a tree-coloring algorithm. The proof statistics comparing the development of this algorithm with and without using the pattern show the efficiency of our solution in terms of proofs reduction.]]></p></abstract>
<kwd-group>
<kwd lng="en"><![CDATA[Distributed algorithms]]></kwd>
<kwd lng="en"><![CDATA[dynamic networks]]></kwd>
<kwd lng="en"><![CDATA[forest]]></kwd>
<kwd lng="en"><![CDATA[formal pattern]]></kwd>
<kwd lng="en"><![CDATA[event-B method]]></kwd>
<kwd lng="en"><![CDATA[coloring]]></kwd>
</kwd-group>
</article-meta>
</front><back>
<ref-list>
<ref id="B1">
<label>1</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Abrial]]></surname>
<given-names><![CDATA[J.-R]]></given-names>
</name>
</person-group>
<source><![CDATA[Modeling in Event-B - System and Software Engineering]]></source>
<year>2010</year>
<publisher-name><![CDATA[Cambridge University Press]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B2">
<label>2</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Abrial]]></surname>
<given-names><![CDATA[J.-R.]]></given-names>
</name>
<name>
<surname><![CDATA[Butler]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Hallerstede]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Hoang]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Mehta]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Voisin]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Rodin: an open toolset for modelling and reasoning in event-b]]></article-title>
<source><![CDATA[International Journal on STTT]]></source>
<year>2010</year>
<volume>12</volume>
<numero>6</numero>
<issue>6</issue>
<page-range>447&#8211;466</page-range></nlm-citation>
</ref>
<ref id="B3">
<label>3</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Back]]></surname>
<given-names><![CDATA[R. J. R]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A calculus of refinements for program derivations]]></article-title>
<source><![CDATA[Acta Informatica]]></source>
<year>1988</year>
<volume>25</volume>
<page-range>593&#8211;624</page-range></nlm-citation>
</ref>
<ref id="B4">
<label>4</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Barjon]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Casteigts]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Chaumette]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Johnen]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Neggaz]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
</person-group>
<source><![CDATA[Maintaining a spanning forest in highly dynamic networks: The synchronous case]]></source>
<year>2014</year>
<conf-name><![CDATA[ 18th International conference on PDS, volume 8878]]></conf-name>
<conf-loc> </conf-loc>
<page-range>277&#8211;292</page-range></nlm-citation>
</ref>
<ref id="B5">
<label>5</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Campolo]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Molinaro]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Scopigno]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<source><![CDATA[Vehicular ad hoc Networks: Standards, Solutions, and Research]]></source>
<year>2015</year>
<edition>1</edition>
<publisher-name><![CDATA[Springer International Publishing]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B6">
<label>6</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Cansell]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Méry]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[The Event-B Modelling Method: Concepts and Case Studies]]></article-title>
<source><![CDATA[Logics of Specification Languages]]></source>
<year>2008</year>
<page-range>47&#8211;152</page-range><publisher-loc><![CDATA[Berlin Heidelberg ]]></publisher-loc>
<publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B7">
<label>7</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Casteigts]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
</person-group>
<source><![CDATA[Contribution à l&#8217;algorithmique distribué dans les réseaux mobiles ad hoc]]></source>
<year>2007</year>
<publisher-name><![CDATA[Université Sciences et Technologies -Bordeaux I]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B8">
<label>8</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Casteigts]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Chaumette]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<source><![CDATA[Dynamicity aware graph relabeling systems (DA-GRS), A local computation based model to describe manet algorithms]]></source>
<year>2005</year>
<conf-name><![CDATA[ International Conference on PDCS]]></conf-name>
<conf-loc> </conf-loc>
<page-range>231&#8211;236</page-range></nlm-citation>
</ref>
<ref id="B9">
<label>9</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Casteigts]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Chaumette]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Ferreira]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<source><![CDATA[Characterizing topological assumptions of distributed algorithms in dynamic networks]]></source>
<year>2009</year>
<conf-name><![CDATA[ 16th international conference on SIROCCO]]></conf-name>
<conf-loc> </conf-loc>
<page-range>126&#8211;140</page-range></nlm-citation>
</ref>
<ref id="B10">
<label>10</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Casteigts]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Chaumette]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Guinand]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Pigné]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
</person-group>
<source><![CDATA[Distributed maintenance of any-time available spanning trees in dynamic networks]]></source>
<year>2013</year>
<conf-name><![CDATA[ 12th international conference on ADHOC-NOW, volume 7960]]></conf-name>
<conf-loc> </conf-loc>
<page-range>99&#8211;110</page-range></nlm-citation>
</ref>
<ref id="B11">
<label>11</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Casteigts]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Flocchini]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
</person-group>
<source><![CDATA[Deterministic algorithms in dynamic networks: Problems, analysis, and algorithmic tools]]></source>
<year>2013</year>
<publisher-loc><![CDATA[Canada ]]></publisher-loc>
<publisher-name><![CDATA[Commissioned by Defense Research and Development]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B12">
<label>12</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Duffy]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
<name>
<surname><![CDATA[O&#8217;Connell]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
<name>
<surname><![CDATA[Sapozhnikov]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Complexity analysis of a decentralised graph colouring algorithm]]></article-title>
<source><![CDATA[Information Processing Letters]]></source>
<year>2008</year>
<volume>107</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>60&#8211;63</page-range></nlm-citation>
</ref>
<ref id="B13">
<label>13</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Fakhfakh]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Tounsi]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Kacem]]></surname>
<given-names><![CDATA[A. H.]]></given-names>
</name>
<name>
<surname><![CDATA[Mosbah]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<source><![CDATA[A formal pattern for dynamic networks through evolving graphs]]></source>
<year>2015</year>
<conf-name><![CDATA[ Computer Systems and Applications (AICCSA), 2015 IEEE/ACS 12th International Conference]]></conf-name>
<conf-loc> </conf-loc>
<page-range>1&#8211;4</page-range></nlm-citation>
</ref>
<ref id="B14">
<label>14</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Fakhfakh]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Tounsi]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Kacem]]></surname>
<given-names><![CDATA[A. H.]]></given-names>
</name>
<name>
<surname><![CDATA[Mosbah]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Towards a formal model for dynamic networks through refinement and evolving graphs]]></article-title>
<source><![CDATA[Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing 2015]]></source>
<year>2016</year>
<page-range>227&#8211;243</page-range><publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B15">
<label>15</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ferreira]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[On models and algorithms for dynamic communication networks: The case for evolving graphs]]></article-title>
<source><![CDATA[4e rencontres francophones sur les Aspects Algorithmiques des Telecommunications]]></source>
<year>2002</year>
<page-range>155&#8211;161</page-range><publisher-name><![CDATA[INRIA Press]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B16">
<label>16</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Floriano]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Goldman]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Arantes]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
</person-group>
<source><![CDATA[Formalization of the necessary and sufficient connectivity conditions to the distributed mutual exclusion problem in dynamic networks]]></source>
<year>2011</year>
<conf-name><![CDATA[ 10th International Symposium on NCA]]></conf-name>
<conf-loc> </conf-loc>
<page-range>203&#8211;210</page-range></nlm-citation>
</ref>
<ref id="B17">
<label>17</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[G. T. Leavens]]></surname>
<given-names><![CDATA[D. B.]]></given-names>
</name>
<name>
<surname><![CDATA[J.-R.]]></surname>
<given-names><![CDATA[Abrial]]></given-names>
</name>
</person-group>
<source><![CDATA[Roadmap for enhanced languages and methods to aid verification]]></source>
<year>2006</year>
<conf-name><![CDATA[ 5th International Conference on GPCE]]></conf-name>
<conf-loc> </conf-loc>
<page-range>221&#8211;236</page-range></nlm-citation>
</ref>
<ref id="B18">
<label>18</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Godard]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Métivier]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Tel]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
</person-group>
<source><![CDATA[Termination detection of local computations]]></source>
<year>2010</year>
<publisher-name><![CDATA[CoRR]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B19">
<label>19</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Hoang]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Fürst]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Abrial]]></surname>
<given-names><![CDATA[J.-R.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Event-b patterns and their tool support]]></article-title>
<source><![CDATA[Software, &amp; Systems Modeling]]></source>
<year>2013</year>
<volume>12</volume>
<page-range>229&#8211;244</page-range></nlm-citation>
</ref>
<ref id="B20">
<label>20</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Jüttner]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Magi]]></surname>
<given-names><![CDATA[Á.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Tree based broadcast in ad hoc networks]]></article-title>
<source><![CDATA[MONET]]></source>
<year>2005</year>
<volume>10</volume>
<numero>5</numero>
<issue>5</issue>
<page-range>753&#8211; 762</page-range></nlm-citation>
</ref>
<ref id="B21">
<label>21</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kang]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Zhao]]></surname>
<given-names><![CDATA[Y.-N.]]></given-names>
</name>
<name>
<surname><![CDATA[Mei]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A graph coloring based tdma scheduling algorithm for wireless sensor networks]]></article-title>
<source><![CDATA[Wireless Personal Communications]]></source>
<year>2013</year>
<volume>72</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>1005&#8211;1022</page-range></nlm-citation>
</ref>
<ref id="B22">
<label>22</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kerchove]]></surname>
<given-names><![CDATA[F. M. D]]></given-names>
</name>
</person-group>
<source><![CDATA[Relabeling Algorithms on Dynamic Graphs]]></source>
<year>2012</year>
<publisher-name><![CDATA[University of Le Havre]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B23">
<label>23</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Litovsky]]></surname>
<given-names><![CDATA[I.]]></given-names>
</name>
<name>
<surname><![CDATA[Métivier]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Sopena]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Graph Relabelling Systems and Distributed Algorithms]]></article-title>
<source><![CDATA[Handbook of graph grammars and computing by graph transformation]]></source>
<year>1999</year>
<page-range>1&#8211;56</page-range><publisher-name><![CDATA[World Scientific]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B24">
<label>24</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Roy]]></surname>
<given-names><![CDATA[R]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Mobile ad hoc networks]]></article-title>
<source><![CDATA[Handbook of Mobile Ad Hoc Networks for Mobility Models]]></source>
<year>2011</year>
<page-range>3&#8211;22</page-range><publisher-loc><![CDATA[US ]]></publisher-loc>
<publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B25">
<label>25</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Tel]]></surname>
<given-names><![CDATA[G]]></given-names>
</name>
</person-group>
<source><![CDATA[Introduction to Distributed Algorithms]]></source>
<year>2000</year>
<publisher-name><![CDATA[Cambridge University Press]]></publisher-name>
</nlm-citation>
</ref>
</ref-list>
</back>
</article>
