For a variety of infinite-state systems, the problem of deciding whether a given system is self-stabilizing or not is investigated from the decidability viewpoint. We develop a unified strategy through which checking self-stabilization is shown to be decidable for lossy vector addition systems with states, one-counter machines, and conflict-free Petri nets. For lossy counter machines and lossy channel systems, in contrast, the self-stabilization problem is shown to be undecidable.
2
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
Self-stabilization is a very interesting and promising research field in computing science. This is due to its guarantees of automatic recovery from any transient failure, without any additional effort. This paper presents an overview of self-stabilizing distributed algorithms. First, the outlook of the self-stabilization paradigm is shown, followed by a simple example and some formal definitions. Then, characteristics of stabilization types are described. Finally, the paper presents several self-stabilizing algorithms and further lines of investigation strive for distributed systems.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.