<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.0 20120330//EN" "JATS-journalpublishing1.dtd"><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" article-type="research-article"><front><journal-meta><journal-id journal-id-type="publisher-id">INFORMATICA</journal-id><journal-title-group><journal-title>Informatica</journal-title></journal-title-group><issn pub-type="epub">0868-4952</issn><issn pub-type="ppub">0868-4952</issn><publisher><publisher-name>VU</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="publisher-id">INF7307</article-id><article-id pub-id-type="doi">10.3233/INF-1996-7307</article-id><article-categories><subj-group subj-group-type="heading"><subject>Research article</subject></subj-group></article-categories><title-group><article-title>Stabilizing protocol for a network of processors</article-title></title-group><contrib-group><contrib contrib-type="Author"><name><surname>Sintonen</surname><given-names>Leo</given-names></name><email xlink:href="mailto:lsi@cs.tut.fi">lsi@cs.tut.fi</email><xref ref-type="aff" rid="j_INFORMATICA_aff_000"/></contrib><aff id="j_INFORMATICA_aff_000">Tampere University of Technology, Software Systems Laboratory, POB 553, 33101 Tampere, Finland</aff></contrib-group><pub-date pub-type="epub"><day>01</day><month>01</month><year>1996</year></pub-date><volume>7</volume><issue>3</issue><fpage>371</fpage><lpage>388</lpage><abstract><p>It is desirable in many applications, that a set of cooperating processes do not loose their coordination due to failures. This paper presents a fault-tolerant protocol for a network of processors, which form a logical ring on a physical broadcast medium. The presented protocol makes possible for a set of processes to reestablish their normal operation after transient or permanent process failure or transient communication failures. The protocol is described, model for the system is developed, and in the framework of this model it is proved, that the system reaches a stable and correct configuration in finitely many steps after failure.</p></abstract><kwd-group><label>Keywords</label><kwd>cooperating processes</kwd><kwd>fault-tolerant computing</kwd><kwd>distributed algorithms</kwd><kwd>self-stabilization</kwd><kwd>token bus protocol</kwd><kwd>event driven protocol</kwd></kwd-group></article-meta></front></article>