From Safety Analysis to Software Requirements
IEEE Transactions on Software Engineering
QSIC '05 Proceedings of the Fifth International Conference on Quality Software
A hierarchical method for the reduction of temporal expressions in Pandora
Proceedings of the First Workshop on DYnamic Aspects in DEpendability Models for Fault-Tolerant Systems
Generalizable safety annotations for specification of failure patterns
Software—Practice & Experience
Component-based timed hazard analysis of self-healing systems
Proceedings of the 8th workshop on Assurances for self-adaptive systems
Compositional synthesis of temporal fault trees from state machines
ACM SIGMETRICS Performance Evaluation Review
| Hi-index | 0.00 |
HiP-HOPS (Hierarchically-Performed Hazard Origin and Propagation 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.