An Exercise in Proving Self-Stabilization through Ljapunov Functions

I
ICDCS
2001
21st IEEE International Conference on Distributed Computing Systems (ICDCS'01)
Abstract - An Exercise in Proving Self-Stabilization through Ljapunov Functions

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Oliver Theel

21st IEEE International Conference on Distributed Computing Systems (ICDCS'01)

Mesa, AZ

April 16-April 19

ISBN: 0-7695-1077-9

	ASCII Text	x
	Oliver Theel, "An Exercise in Proving Self-Stabilization through Ljapunov Functions," Distributed Computing Systems, International Conference on, pp. 0727, 21st IEEE International Conference on Distributed Computing Systems (ICDCS'01), 2001.

	BibTex	x
	@article{ 10.1109/ICDSC.2001.919010, author = {Oliver Theel}, title = {An Exercise in Proving Self-Stabilization through Ljapunov Functions}, journal ={Distributed Computing Systems, International Conference on}, volume = {0}, year = {2001}, isbn = {0-7695-1077-9}, pages = {0727}, doi = {http://doi.ieeecomputersociety.org/10.1109/ICDSC.2001.919010}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Distributed Computing Systems, International Conference on TI - An Exercise in Proving Self-Stabilization through Ljapunov Functions SN - 0-7695-1077-9 SP EP A1 - Oliver Theel, PY - 2001 VL - 0 JA - Distributed Computing Systems, International Conference on ER -

Oliver Theel, Darmstadt University of Technology

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICDSC.2001.919010

Abstract: Self-Stabilizing distributed algorithms exhibit interesting analogies with stabilizing feedback systems used in various engineering domains. In this paper we show by Dijkstra's famous token ring algorithm for mutual exclusion serving as an example that methodologies from control theory, namely Ljapunov's "Second Method," can be used to more easily and systematically prove the self-stabilization property of distributed algorithms.

Citation:

Oliver Theel, "An Exercise in Proving Self-Stabilization through Ljapunov Functions," icdcs, pp.0727, 21st IEEE International Conference on Distributed Computing Systems (ICDCS'01), 2001

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.