Dependability engineering of silent self-stabilizing systems

7Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Self-stabilization is an elegant way of realizing non-masking fault-tolerant systems. Sustained research over last decades has produced multiple self-stabilizing algorithms for many problems in distributed computing. In this paper, we present a framework to evaluate multiple self-stabilizing solutions under a fault model that allows intermittent transient faults. To that end, metrics to quantify the dependability of self-stabilizing systems are defined. It is also shown how to derive models that are suitable for probabilistic model checking in order to determine those dependability metrics. A heuristics-based method is presented to analyze counterexamples returned by a probabilistic model checker in case the system under investigation does not exhibit the desired degree of dependability. Based on the analysis, the self-stabilizing algorithm is subsequently refined. © 2009 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Dhama, A., Theel, O., Crouzen, P., Hermanns, H., Wimmer, R., & Becker, B. (2009). Dependability engineering of silent self-stabilizing systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5873 LNCS, pp. 238–253). https://doi.org/10.1007/978-3-642-05118-0_17

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free