Abstract
Fault tolerance via diversity has been advocated as a viable defence against common-mode failure in safety critical systems. The consequences of using diverse, redundant software components in fault-tolerant, software-based systems have been the subject of much research. In particular, Littlewood and Miller showed analytically how “forcing” diversity between redundant software components might achieve higher expected system reliability than if these components failed independently. But their theorems concerned very special scenarios. This paper examines various lower and upper bounds on the expected reliability of systems built by ”forcing diversity” and specify conditions for forced diversity to guarantee improved upper bounds on the system’s expected probability of failure on demand (pfd).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Eckhardt, D.E., Lee, L.D.: A theoretical basis for the analysis of multiversion software subject to coincident errors. IEEE Transactions on Software Engineering SE-11, 1511–1517 (1985)
Littlewood, B., Miller, D.R.: Conceptual modelling of coincident failures in multi-version software. IEEE Transactions on Software Engineering SE-15, 1596–1614 (1989)
Salako, K.: Appendices (2007), http://www.csr.city.ac.uk/staff/salako/papers/Safecomp2007/
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Salako, K. (2007). Bounds on the Reliability of Fault-Tolerant Software Built by Forcing Diversity. In: Saglietti, F., Oster, N. (eds) Computer Safety, Reliability, and Security. SAFECOMP 2007. Lecture Notes in Computer Science, vol 4680. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75101-4_38
Download citation
DOI: https://doi.org/10.1007/978-3-540-75101-4_38
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75100-7
Online ISBN: 978-3-540-75101-4
eBook Packages: Computer ScienceComputer Science (R0)