Probabilistic Compositional Reasoning for Guaranteeing Fault Tolerance Properties
- Cite this paper as:
- Blech J.O. (2011) Probabilistic Compositional Reasoning for Guaranteeing Fault Tolerance Properties. In: Fernàndez Anta A., Lipari G., Roy M. (eds) Principles of Distributed Systems. OPODIS 2011. Lecture Notes in Computer Science, vol 7109. Springer, Berlin, Heidelberg
We present a framework to formally describe system behavior and symbolically reason about possible failures. We regard systems which are composed of different units: sensors, computational parts and actuators. Considering worst-case failure behavior of system components, our framework is used to derive reliability guarantees for composed systems. The behavior of system components is modeled using monad like constructs that serve as an abstract representation for system behavior. We introduce rules to reason about these representations and derive results like, e.g., guaranteed upper bounds for system failure. Our approach is characterized by the fact that we do not just map a certain component to a failure probability, but regard distributions of error behavior. These serve as basis for deriving failure probabilities.
Unable to display preview. Download preview PDF.