This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
12th International Conference on Parallel and Distributed Systems - Volume 1 (ICPADS'06)
Verification of Orbitally Self-Stabilizing Distributed Algorithms Using Lyapunov Functions and Poincare Maps
Minneapolis, Minnesota
July 12-July 15
ISBN: 0-7695-2612-8
ASCII Text
x 
 
Abhishek Dhama, Jens Oehlerking, Oliver Theel, "Verification of Orbitally Self-Stabilizing Distributed Algorithms Using Lyapunov Functions and Poincare Maps," Parallel and Distributed Systems, International Conference on, vol. 1, pp. 23-30, 12th International Conference on Parallel and Distributed Systems - Volume 1 (ICPADS'06), 2006.
 
 
BibTex
x
 
@article{ 10.1109/ICPADS.2006.108,
author = {Abhishek Dhama and Jens Oehlerking and Oliver Theel},
title = {Verification of Orbitally Self-Stabilizing Distributed Algorithms Using Lyapunov Functions and Poincare Maps},
journal ={Parallel and Distributed Systems, International Conference on},
volume = {1},
year = {2006},
issn = {1521-9097},
pages = {23-30},
doi = {http://doi.ieeecomputersociety.org/10.1109/ICPADS.2006.108},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Parallel and Distributed Systems, International Conference on
TI - Verification of Orbitally Self-Stabilizing Distributed Algorithms Using Lyapunov Functions and Poincare Maps
SN - 1521-9097
SP23
EP30
A1 - Abhishek Dhama,
A1 - Jens Oehlerking,
A1 - Oliver Theel,
PY - 2006
KW - Fault Tolerance
KW - Self-Stabilization
KW - Verification
KW - Hybrid Systems
KW - Lyapunov Theory
KW - Poincar?e maps
VL - 1
JA - Parallel and Distributed Systems, International Conference on
ER -
 
Abhishek Dhama, Carl von Ossietzky University of Oldenburg. Germany
Jens Oehlerking, Carl von Ossietzky University of Oldenburg. Germany
Oliver Theel, Carl von Ossietzky University of Oldenburg. Germany
Self-stabilization is a novel method for achieving fault tolerance in distributed applications. A self-stabilizing algorithm will reach a legal set of states, regardless of the starting state or states adopted due to the effects of transient faults, in finite time. However, proving self-stabilization is a difficult task. In this paper, we present a method for showing self-stabilization of a class of non-silent distributed algorithms, namely orbitally self-stabilizing algorithms. An algorithm of this class is modeled as a hybrid feedback control system. We then employ the control theoretic methods of Poincar?e maps and Lyapunov functions to show convergence to an orbit cycle.
Index Terms:
Fault Tolerance, Self-Stabilization, Verification, Hybrid Systems, Lyapunov Theory, Poincar?e maps
Citation:
Abhishek Dhama, Jens Oehlerking, Oliver Theel, "Verification of Orbitally Self-Stabilizing Distributed Algorithms Using Lyapunov Functions and Poincare Maps," icpads, vol. 1, pp.23-30, 12th International Conference on Parallel and Distributed Systems - Volume 1 (ICPADS'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.