A new technique for proving self-stabilizing under the distributed scheduler

Sven Köhler, Volker Turau

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

4 Scopus citations

Abstract

Proving stabilization of a complex algorithm under the distributed scheduler is a non-trivial task. This paper introduces a new method which allows to extend proofs for the central scheduler to the distributed scheduler. The practicability of the method is shown by applying it to two existing algorithms, for which stabilization under the distributed scheduler was an open problem.

Original languageEnglish
Title of host publicationStabilization, Safety, and Security of Distributed Systems - 12th International Symposium, SSS 2010, Proceedings
Pages65-79
Number of pages15
DOIs
StatePublished - 2010
Externally publishedYes
Event12th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2010 - New York, NY, United States
Duration: 20 Sep 201022 Sep 2010

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6366 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference12th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2010
Country/TerritoryUnited States
CityNew York, NY
Period20/09/1022/09/10

Bibliographical note

Funding Information:
This research was funded by the German Research Foundation (DFG), contract number TU 221/3-1.

Funding

This research was funded by the German Research Foundation (DFG), contract number TU 221/3-1.

FundersFunder number
Deutsche ForschungsgemeinschaftTU 221/3-1

    Fingerprint

    Dive into the research topics of 'A new technique for proving self-stabilizing under the distributed scheduler'. Together they form a unique fingerprint.

    Cite this