Minimal cut sequence generation for state/event fault trees

Authors:
Bingfeng Xu;Zhiqiu Huang;Jun Hu;Ou Wei;Yu Zhou
Affiliations:
Nanjing University of Aeronautics and Astronautics, Nanjing, China;Nanjing University of Aeronautics and Astronautics, Nanjing, China;Nanjing University of Aeronautics and Astronautics, Nanjing, China;Nanjing University of Aeronautics and Astronautics, Nanjing, China;Nanjing University of Aeronautics and Astronautics, Nanjing, China
Venue:
Proceedings of the 2013 Middleware Doctoral Symposium
Year:
2013

Citing 6
Cited 0

Interface automata

Proceedings of the 8th European software engineering conference held jointly with 9th ACM SIGSOFT international symposium on Foundations of software engineering
Fault Tree and Formal Methods in System Safety Analysis

CIT '04 Proceedings of the The Fourth International Conference on Computer and Information Technology
Formal Fault Tree Analysis - Practical Experiences

Electronic Notes in Theoretical Computer Science (ENTCS)
Cut Sequence Set Generation for Fault Tree Analysis

ICESS '07 Proceedings of the 3rd international conference on Embedded Software and Systems
Formal safety analysis in industrial practice

FMICS'11 Proceedings of the 16th international conference on Formal methods for industrial critical systems
Quantification of cut sequence set for fault tree analysis

HPCC'07 Proceedings of the Third international conference on High Performance Computing and Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

State/Event Fault Trees (SEFTs) have been developed to conduct safety modeling and assessment for safety critical systems. The purpose of minimal cut sequence analyses performed on this kind of model consists in computing the minimal scenarios that lead to system failures. As SEFTs do not provide a well-defined semantics that is essential for minimal cut sequence analysis, this paper proposes a minimal cut sequence analysis method for SEFTs based on interface automata. Firstly, in order to describe triggers and guards of SEFTs simultaneously, guarded interface automaton is proposed by adding guards on the transitions of interface automaton. Secondly, the precise semantics of SEFTs is given based on the guarded interface automata. After that, a minimal cut sequence analysis method is presented based on formal semantic model of SEFTs. Finally, the method in this paper is illustrated by modeling and analyzing the SEFT of a fire protection system. Our method is a new solution for minimal cut sequence analysis of SEFTs.