Communicating sequential processes
Communicating sequential processes
On the reliability of consensus-based fault-tolerant distributed computing systems
ACM Transactions on Computer Systems (TOCS)
From CSP Models to Markov Models
IEEE Transactions on Software Engineering
Self-stabilizing depth-first search
Information Processing Letters
Optimal availability quorum systems: theory and practice
Information Processing Letters
Fundamentals of fault-tolerant distributed computing in asynchronous environments
ACM Computing Surveys (CSUR)
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
Self-stabilization
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Probability and statistics with reliability, queuing and computer science applications
Probability and statistics with reliability, queuing and computer science applications
Replication Techniques in Distributed Systems
Replication Techniques in Distributed Systems
Construction of Abstract State Graphs with PVS
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Basic Concepts and Taxonomy of Dependable and Secure Computing
IEEE Transactions on Dependable and Secure Computing
Dependability Engineering of Silent Self-stabilizing Systems
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
| Hi-index | 0.00 |
Self-stabilizing systems are often only evaluated in terms of worst-case time and space complexities for the recovery from arbitrary state disruptions. In this paper, we interpret and formalize well-known fault tolerance measures for masking fault-tolerant systems, namely reliabilty, instantaneous availability, and limiting availability in the context of self-stabilizing systems. This allows to additionally evaluate selfstabilizing systems by these well-accepted measures. The calculation is challenging due to a large (and possibly infinite) state space. We present an analysis procedure that comprises a suitable state abstraction thereby making the calculation tractable. Exemplarily, we apply the procedure to a system that constructs a depth-first search spanning tree showing that our approach is feasible and yields meaningful results.