A characterization of the dynamical ascending routing

A characterization of a routing defined on a dynamical logical structure is presented. By uniting the structure with the messages destabilizing it, an invariant is obtained, that allows a simple proof of the properties of the routing. The results are exploited by designing and structuring the proof...

Full description

Saved in:
Bibliographic Details
Published inWorkshop on the Future Trends of Distributed Computing Systems in the 1990s: Proceedings pp. 237 - 244
Main Authors Bouabdallah, A., Trehel, M.
Format Conference Proceeding
LanguageEnglish
Published IEEE Comput. Soc. Press 1988
Subjects
Algorithm design and analysis
Computer networks
Distributed algorithms
Formal specifications
Graph theory
Logic
Nominations and elections
Processor scheduling
Routing
Safety
Online AccessGet full text
ISBN9780818608971
0818608978
DOI10.1109/FTDCS.1988.26703

Cover

More Information
Summary:A characterization of a routing defined on a dynamical logical structure is presented. By uniting the structure with the messages destabilizing it, an invariant is obtained, that allows a simple proof of the properties of the routing. The results are exploited by designing and structuring the proof of the mutual exclusion algorithm, which uses this routing. The specifications are done in an axiomatic manner, and the proof is given in a temporal framework.< >
ISBN:9780818608971
0818608978
DOI:10.1109/FTDCS.1988.26703