Temporal fault trees

被引:43
作者
Palshikar, GK [1 ]
机构
[1] Tate Res Dev & Design Ctr, Pune 411013, Maharashtra, India
关键词
fault tree; temporal logic; hazard analysis; safety analysis; diagnosis;
D O I
10.1016/S0950-5849(01)00223-3
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Fault tree (FT) is a simple, visual, popular and standardized notation for representing relationships between a fault in a system and the associated events. FTs are widely used for supporting products and systems in diverse industries like process control, avionics, aerospace, nuclear power systems, etc. where they are used to capture specialized and experiential knowledge for diagnosis and maintenance. FTs are also used to represent safety requirements of a system, obtained during the hazard analysis phase of the system development cycle. However, a problem that prevents more analytical use of FT is their lack of rigorous semantics. Users' understanding of an FT depends on the clarity and correctness of the natural language annotations used to label and describe various parts. Moreover, it is not clear how to adapt the FT notation to represent temporal relationships between faults and events in dynamic systems. We propose to augment the FT notation by adding simple temporal gates to capture temporal dependence between events and faults. We propose techniques to perform qualitative analysis of such temporal fault trees (TFT) to detect the causes of the top event fault by matching the TFT with the trace (or log) of the system activities. We present two algorithms for depth-first traversal and cut-set computations for a given TFT that can be used for diagnosis based on TFTs. (C) 2002 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:137 / 150
页数:14
相关论文
共 32 条
[1]  
Allen J. E., 1994, Journal of Logic and Computation, V4, P531, DOI 10.1093/logcom/4.5.531
[2]   A THEORY OF TIMED AUTOMATA [J].
ALUR, R ;
DILL, DL .
THEORETICAL COMPUTER SCIENCE, 1994, 126 (02) :183-235
[3]   A REALLY TEMPORAL LOGIC [J].
ALUR, R ;
HENZINGER, TA .
JOURNAL OF THE ACM, 1994, 41 (01) :181-204
[4]  
[Anonymous], 1981, FAULT TREE HDB
[5]   MODELING AND VERIFICATION OF TIME-DEPENDENT SYSTEMS USING TIME PETRI NETS [J].
BERTHOMIEU, B ;
DIAZ, M .
IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1991, 17 (03) :259-273
[6]  
Bobbio A, 1999, LECT NOTES COMPUT SC, V1698, P310
[7]  
CLOCKSIN WF, 1989, PROGRAMMING PROLOG 3
[8]  
Emerson E.A., 1990, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics, P995, DOI [DOI 10.1016/B978-0-444-88074-1.50021-4, 10.1016/B978-0-444-88074-1.50021-4.]
[9]   PROVING PROPERTIES OF REAL-TIME SYSTEMS THROUGH LOGICAL SPECIFICATIONS AND PETRI-NET MODELS [J].
FELDER, M ;
MANDRIOLI, D ;
MORZENTI, A .
IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1994, 20 (02) :127-141
[10]   A UNIFIED HIGH-LEVEL PETRI NET FORMALISM FOR TIME-CRITICAL SYSTEMS [J].
GHEZZI, C ;
MANDRIOLI, D ;
MORASCA, S ;
PEZZE, M .
IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1991, 17 (02) :160-172