DocumentCode :
1838005
Title :
Formal static fault tree analysis
Author :
Xiang, Jianwen ; Yanoo, Kazuo
Author_Institution :
Service Platform Res. Labs., NEC Corp., Kawasaki, Japan
fYear :
2010
fDate :
Nov. 30 2010-Dec. 2 2010
Firstpage :
280
Lastpage :
286
Abstract :
Fault tree analysis (FTA) is a traditional informal reliability and safety analysis technique. FTA is basically a combinational model in which standard Boolean logic constructs, such as AND and OR gates, are used to decompose the fault events. Several dynamic constructs, such as Functional Dependency (FDEP) and Priority AND (PAND) gates, are also proposed to handle dynamic behaviors of system failure mechanisms. In this article, we focus on some paradoxes and constraints of the traditional FDEP and PAND gates, and present our static solutions to these dynamic gates. The proposed static fault tree model is formalized with Maude, an executable algebraic formal specification language. Two example fault tolerant parallel processor (FTPP) configurations are used to demonstrate our static fault tree model.
Keywords :
fault trees; formal concept analysis; formal specification; logic gates; Boolean logic; executable algebraic formal specification language; fault events; fault tolerant parallel processor configurations; formal static fault tree analysis; functional dependency; priority AND gates; safety analysis technique; standard Boolean logic; static fault tree model; Fault tolerance; Fault tolerant systems; Fault trees; Logic gates; Markov processes; Semantics; Fault tree analysis; formal methods; functional dependency; reliability; sequential dependency;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer Engineering and Systems (ICCES), 2010 International Conference on
Conference_Location :
Cairo
Print_ISBN :
978-1-4244-7040-2
Type :
conf
DOI :
10.1109/ICCES.2010.5674869
Filename :
5674869
Link To Document :
بازگشت