An exercise in proving convergence through transfer functions
Self-stabilizing algorithms must fulfill two requirements generally called closure and convergence. We are interested in the convergence property and discuss a new method for proving it. Usually proving the convergence of self-stabilizing algorithms requires a well foundedness argument: briefly spok...
Gespeichert in:
Hauptverfasser: | , |
---|---|
Format: | Tagungsbericht |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Schreiben Sie den ersten Kommentar!