ALGEBRAIC MODELLING OF FAULT TREES WITH PRIORITY AND GATES

Abstract This paper presents a formal framework allowing to extend the simplification of static fault trees to fault trees built with gates PRIORITY AND. The laws which make these simplifications possible have been demonstrated thanks to a homogeneous algebraic definition of each gate studied. These definitions use a mathematical model of events able to take into account their order of appearance. The processing of an example points out the possibilities offered by this algebraic framework dedicated to non-repairable faults.

[1]  Makis Stamatelatos,et al.  Fault tree handbook with aerospace applications , 2002 .

[2]  Bernhard Kaiser,et al.  State/event fault trees - A safety analysis model for software-controlled systems , 2007, Reliab. Eng. Syst. Saf..

[3]  W E Vesely,et al.  Fault Tree Handbook , 1987 .

[4]  David Coppit,et al.  Formal semantics of models for computational engineering: a case study on dynamic fault trees , 2000, Proceedings 11th International Symposium on Software Reliability Engineering. ISSRE 2000.

[5]  Bernhard Kaiser,et al.  State-Event-Fault-Trees - A Safety Analysis Model for Software Controlled Systems , 2004, SAFECOMP.

[6]  David He,et al.  Sequential failure analysis using counters of Petri net models , 2003, IEEE Trans. Syst. Man Cybern. Part A.

[7]  Ralph P. Grimaldi,et al.  Discrete and combinatorial mathematics , 1985 .

[8]  J. Dugan,et al.  Minimal cut set/sequence generation for dynamic fault trees , 2004, Annual Symposium Reliability and Maintainability, 2004 - RAMS.

[9]  Kerstin Buchacker,et al.  Modeling with extended fault trees , 2000, Proceedings. Fifth IEEE International Symposium on High Assurance Systems Engineering (HASE 2000).

[10]  Yiannis Papadopoulos,et al.  PANDORA : THE TIME OF PRIORITY-AND GATES , 2006 .