Abstract
HiP-HOPS (Hierarchically-Performed Hazard Origin and Propaga-tion Studies) is a recent technique that partly automates Fault Tree Analysis (FTA) by constructing fault trees from system topologies annotated with component-level failure specifications. HiP-HOPS has hitherto created only classical combinatorial fault trees that fail to capture the often significant temporal ordering of failure events. In this paper, we propose temporal extensions to the fault tree notation that can elevate HiP-HOPS, and potentially other FTA techniques, above the classical combinatorial model of FTA. We develop the formal foundations of a new logic to represent event sequences in fault trees using Priority-AND, Simultaneous-AND, and Priority-OR gates, and present a set of temporal laws to identify logical contradictions and remove redundancies in temporal fault trees. By qualitatively analysing these temporal trees to obtain ordered minimal cut-sets, we show how these extensions to FTA can enhance the safety of dynamic systems.
This is a preview of subscription content, log in via an institution to check access.
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
Papadopoulos, Y.I., McDermid, J.A., Sasse, R., Heiner, G.: Analysis and Synthesis of the Behaviour of Complex Systems in Conditions of Failure. Reliability Engineering & System Safety 71(3), 229–247 (2001)
Grunske, L., Kaiser, B.: Automatic Generation of Analyzable Failure Propagation Models from Component-Level Failure Annotations. In: Fifth International Conference on Quality Software (QSIC 2005), pp. 117–123. IEEE Computer Society, Los Alamitos (2005)
Walker, M.D., Papadopoulos, Y.I.: Pandora: The Time of Priority-AND gates. In: INCOM 2006, France, pp. 237–242 (2006)
Fussel, J.B., Aber, E.F., Rahl, R.G.: On quantitative analysis of PAND failure logic. IEEE Trans. on Reliability R-25/5, 324–326 (1976)
Vesely, W.E., Goldberg, F.F., Roberts, N.H., Haasl, D.F.: Fault Tree Handbook. US Nuclear Regulatory Commission, Washington D.C., USA (1981)
Long, W., Sato, Y., Horigome, M.: Quantification of sequential failure logic for fault tree analysis. Reliability Engineering & System Safety 67, 269–274 (2000)
Vesely, W.E., Stamatelatos, M., Dugan, J.B., Fragola, J., Minarick, J., Railsback, J.: Fault Tree Handbook with Aerospace Applications. NASA Office of Safety and Mission Assurance, USA (2002)
Tang, Z., Dugan, J.B.: Minimal cut set/sequence generation for dynamic fault trees. In: Annual Reliability and Maintainability Symposium Proceedings (2004)
Palshikar, G.K.: Temporal Fault Trees. Information and Software Technology 44, 137–150 (2002)
Wijayarathna, P.G., Kawata, Y., Santosa, A., Isogai, K.: Representing relative temporal knowledge with the tand connective. Eighth Ireland Conference on Artificial Intelligence (AI 1997) 2, 80–87 (1997)
Andrews, J.D.: To not or not to not. In: Proceedings of the 18th International System Safety Conference, Fort Worth, September 2000, pp. 267–275 (2000)
Gorski, J., Wardzinski, A.: Deriving Real-Time Requirements for Software from Safety Analysis. In: Proc. 8th Euromicro Workshop on Real-Time Systems, pp. 9–14. IEEE Computer Society Press, Los Alamitos (1996)
Hansen, K.M., Ravn, A.P.: From Safety Analysis to Software Requirements. IEEE Trans. on Software Engineering 24(7), 573–584 (1998)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Walker, M., Bottaci, L., Papadopoulos, Y. (2007). Compositional Temporal Fault Tree Analysis. 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_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-75101-4_12
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)