research-article

Minimal cut sequence generation for state/event fault trees

Authors:

Yu ZhouAuthors Info & Claims

MDS '13: Proceedings of the 2013 Middleware Doctoral Symposium

Article No.: 3, Pages 1 - 6

https://doi.org/10.1145/2541534.2541592

Published: 09 December 2013 Publication History

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.

References

[1]

Daskaya, I., Huhn, M. and Milius, S. 2011. Formal safety analysis in industrial practice. In Proceeding of Formal Methods for Industrial Critical Systems (FMICS 2011). Berlin: Springer-Verlag, LNCS 6959, 68--84.

Digital Library

[2]

Xiang, J., Futatsugi, K. and He, Y. 2004. Fault tree and formal methods in system safety analysis. In Proceedings of the Fourth International Conference on Computer and Information Technology (CIT'04). Wuhan: IEEE Computer Society Press, 1108--1115.

Digital Library

[3]

Xing, L. and Amari, S. V. 2008. Fault Tree Analysis. Handbook of Performability Engineering, Springer London, Springer-Verlag London Limited, 595--620.

[4]

Ortmeier, F. and Schellhorn, G. 2007. Formal fault tree analysis-practical experiences. Electronic Notes in Theoretical Computer Science, 185, 139--151.

Digital Library

[5]

Tang, Z. 2004. Minimal cut set/sequence generation for dynamic fault trees. In Proceedings of Annual Reliability and Maintainability symposium (2004), LA.

[6]

Kaiser, B. 2007. State Event trees: a safety and reliabiity analysis techniqure for software controlled systems. Kaiserslautern: University Kaiserslautern.

[7]

De Alfaro, L. and Henzinger, T. A. 2001. Interface automata. In Proceedings of the joint 8th European Software Engineering conference and 9th ACM SIGSOFT International Symposium on the Foundations of Software Engineering (ESEC/FSE 01), Austria, 108--120.

Digital Library

[8]

Kaiser, B., Gramlich, C. and Forster M. 2007. State/event fault trees--a safety analysis model for software-controlled systems. Reliability Engineering & System Safety, 92(11), 1521--1537.

[9]

Rauzy, A. 2001. Mathmetical foundations of minimal cut sets. IEEE Transactions on Reliability, 50, 389--396.

[10]

Liu, D., Xing, W. and Zhang, C. 2007. Cut sequence set generation for fault tree analysis. In Proceedings of International Conference on Economics and Social Science (ICESS 2007). Springer, Heidelberg, LNCS 4523, 592--603.

Digital Library

[11]

Liu, D., Zhang, C., Xing, W., Li, R. and Li, H. 2007. Quantification of cut sequence set for fault tree analysis. In Proceedings of The Third International Conference on High Performance Computing and Communications (HPCC 2007), LNCS 4782, 755--765.

Digital Library

[12]

Xing, L., Shrestha, A. and Dai, Y. 2011. Exact combinatorial reliability analysis of dynamic systems with sequence-dependent failures. Reliability engineering & systems safety, 96(10), 1375--1385.

[13]

Assaf, T. and Dugan, J. B. 2004. Diagnostic expert systems from dynamic fault trees. In Proceedings of Annual Reliability and Maintainability Symposium (2004), LA.

[14]

Chaux, P. Y., Roussel, J. M., Lesage, J. J., Deleuze, G. and Bouissou, M. 2012. Systematic extraction of minimal cut sequences from a BDMP model. In: Proceedings of 21th European Safety & Reliability Conference (ESREL'12).

[15]

Hersmans, H. 2002. Interactive Markov Chains. Springer Berlin.

Cited By

Ruijters EStoelinga M(2018)Fault tree analysisComputer Science Review10.1016/j.cosrev.2015.03.00115:C(29-62)Online publication date: 13-Dec-2018
https://dl.acm.org/doi/10.1016/j.cosrev.2015.03.001
Kabir S(2017)An overview of fault tree analysis and its application in model based dependability analysisExpert Systems with Applications: An International Journal10.1016/j.eswa.2017.01.05877:C(114-135)Online publication date: 1-Jul-2017
https://dl.acm.org/doi/10.1016/j.eswa.2017.01.058

Index Terms

Minimal cut sequence generation for state/event fault trees
1. Social and professional topics
  1. Professional topics
    1. Management of computing and information systems
      1. System management
        Quality assurance

Recommendations

Is Cut Sequence Necessary in Dynamic Fault Trees?
ISSREW '14: Proceedings of the 2014 IEEE International Symposium on Software Reliability Engineering Workshops

The dynamic fault trees (DFT) is proposed to model sequence dependencies between fault events based on the traditional static fault tree (SFT). In the analysis of DFT, only combinations of basic events may not be suffincient to imply the top event (TE) ...
Minimal cut-generating functions are nearly extreme

We study continuous (strongly) minimal cut generating functions for the model where all variables are integer. We consider both the original Gomory---Johnson setting as well as a recent extension by Yıldız and Cornuéjols (Math Oper Res 41:1381---1403, ...
Minimal Cut-Generating Functions are Nearly Extreme
IPCO 2016: Proceedings of the 18th International Conference on Integer Programming and Combinatorial Optimization - Volume 9682

We study continuous strongly minimal cut generating functions for the model where all variables are integer. We consider both the original Gomory-Johnson setting as well as a recent extension by Cornuéjols and Yıldız. We show that for any continuous ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

MDS '13: Proceedings of the 2013 Middleware Doctoral Symposium

December 2013

40 pages

ISBN:9781450325486

DOI:10.1145/2541534

Program Chairs:
Anders Andersen
University of Tromsø, Norway
,
Chang Xu
Nanjing University, China

Copyright © 2013 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

ACM: Association for Computing Machinery
Commemorative Organization for the Japan World Exposition '70
IFIP

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 09 December 2013

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Funding Sources

National Natural Science Foundation of China
Funding of Jiangsu Innovation Program for Graduate Education and the Fundamental Research Funds for the Central Universities
Innovative Team of Jiangsu Province
Project sponsored by SRF for ROCS, SEM 2012

Conference

Middleware '13

Sponsor:

ACM

Middleware '13: 14th International Middleware Conference

December 9 - 13, 2013

Beijing, China

Upcoming Conference

MIDDLEWARE '24

25th International Middleware Conference

December 2 - 6, 2024

Hong Kong , Hong Kong

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
133
Total Downloads

Downloads (Last 12 months)1
Downloads (Last 6 weeks)0

Reflects downloads up to 10 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Ruijters EStoelinga M(2018)Fault tree analysisComputer Science Review10.1016/j.cosrev.2015.03.00115:C(29-62)Online publication date: 13-Dec-2018
https://dl.acm.org/doi/10.1016/j.cosrev.2015.03.001
Kabir S(2017)An overview of fault tree analysis and its application in model based dependability analysisExpert Systems with Applications: An International Journal10.1016/j.eswa.2017.01.05877:C(114-135)Online publication date: 1-Jul-2017
https://dl.acm.org/doi/10.1016/j.eswa.2017.01.058

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents