Self-stabilizing algorithms

This page is devoted to self-stabilizing algorithms. Our goal is to create tools to develop and test self-stabilizing algorithms. Such a tool is under construction. An early version is accessible as an applet below (requires Java VM 1.4). Please try it and give comments to the author kuszner@eti.pg.gda.pl. At this time only some algorithms are available.

Available algorithms

Some of available algorithms are carefully defined and analyzed:

Algorithm

Description

Grundy Coloring,
Trivial Coloring
Hedetniemi S. T., Jacobs D. P., Srimani P. K., Linear time self-stabilizing colorings, Information Processing Letters 87 (2003) 251--255.
Maximal Independent Set,
Minimal Dominating Set
S. M. Hedetniemi, S. T. Hedetniemi, D. P. Jacobs and P. K. Srimani, Self-stabilizing Algorithms for Minimal Dominating Sets and Maximal Independent Set, Computer Mathematics and Applications, 2003
Edge Coloring Rules: (ps) (pdf))
LF Coloring Rules: (ps) (pdf)

Download

source code (zip)
documentation (zip)

To do

Your help is appreciated.

Researchers

This is a list of some researchers who work on self-stabilizing algorithms

Links

Other pages on subject:

Books

Some books:

Conferences

Problems

Acknowledgement


Page history

£ukasz Kuszner, e-mail:kuszner@eti.pg.gda.pl

Last revised: 7 October 2005