Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
research-article
Open access

Fault trees on a diet: automated reduction by graph rewriting

Published: 01 July 2017 Publication History

Abstract

Fault trees are a popular industrial technique for reliability modelling and analysis. Their extension with common reliability patterns, such as spare management, functional dependencies, and sequencing—known as dynamic fault trees (DFTs)—has an adverse effect on scalability, prohibiting the analysis of complex, industrial cases. This paper presents a novel, fully automated reduction technique for DFTs. The key idea is to interpret DFTs as directed graphs and exploit graph rewriting to simplify them. We present a collection of rewrite rules, address their correctness, and give a simple heuristic to determine the order of rewriting. Experiments on a large set of benchmarks show substantial DFT simplifications, yielding state space reductions and timing gains of up to two orders of magnitude.

References

References

[1]
Arnold F, Belinfante A, van der Berg F, Guck D, Stoelinga MIA (2013) DFTCalc: a tool for efficient fault tree analysis. In: Proc of SAFECOMP, LNCS. Springer, Berlin, pp 293–301.
[2]
Bozzano M, Cimatti A, Katoen J-P, Nguyen VY, Noll T, and Roveri M Safety, dependability and performance analysis of extended AADL models Comput J 2011 54 754-775
[3]
Boudali H, Crouzen P, and Stoelinga MIA A rigorous, compositional, and extensible framework for dynamic fault tree analysis IEEE Trans Dependable Secur Comput 2010 7 2 128-143
[4]
Boudali H and Dugan JB A discrete-time Bayesian network reliability modeling and analysis framework Reliab Eng Syst Safety 2005 87 3 337-349
[5]
Boudali H and Dugan JB A continuous-time Bayesian network reliability modeling and analysis framework IEEE Trans Reliab 2006 55 1 86-97
[6]
Bobbio A, Franceschinis G, Gaeta R, and Portinale L Parametric fault tree for the dependability analysis of redundant systems and its high-level Petri net semantics IEEE Trans Softw Eng 2003 29 3 270-287
[7]
Baier C, Haverkort BR, Hermanns H, and Katoen J-P Model-checking algorithms for continuous-time Markov chains IEEE Trans Softw Eng 2003 29 6 524-541
[8]
Bobbio A, Portinale L, Minichino M, and Ciancamerla E Improving the analysis of dependable systems by mapping fault trees into Bayesian networks Reliab Eng Syst Safety 2001 71 3 249-260
[9]
Buchacker K (2000) Modeling with extended fault trees. In: Proc of HASE, pp 238–246
[10]
Chiacchio F, Compagno L, D’Urso D, Manno G, and Trapani N Dynamic fault trees resolution: a conscious trade-off between analytical and simulative approaches Reliab Eng Syst Safety 2011 96 11 1515-1526
[11]
Contini S, Cojazzi GGM, Renda G (2008) On the use of non-coherent fault trees in safety and security studies. In: Proc European safety and reliability conf (ESREL), pp 1886–1895
[12]
Crouzen P, Hermanns H, Zhang L (2008) On the minimisation of acyclic models. In: CONCUR, vol 5201 of LNCS. Springer, Berlin, pp 295–309
[13]
Coppit D, Sullivan KJ, Dugan JB (2000) Formal semantics of models for computational engineering: a case study on dynamic fault trees. In: Proc of ISSRE, pp 270–282
[14]
Dugan JB, Bavuso SJ, and Boyd MA Dynamic fault-tree models for fault-tolerant computer systems IEEE Trans Reliab 1992 41 3 363-377
[15]
Dershowitz N, Jouannaud J-P (1991) Rewrite systems. In: van Leeuwen J (ed) Handbook of theoretical computer science. MIT Press, Cambridge, pp 243–320
[16]
Dugan JB, Venkataraman B, Gulati R (1997) DIFtree: a software package for the analysis of dynamic fault tree models. In: Proc of RAMS, IEEE, pp 64–70
[17]
Ehrig H, Ehrig K, Prange U, Taentzer G (2006) Fundamentals of algebraic graph transformation. Monographs in Th. Comp. Science. Springer, Berlin
[18]
Ehrig H (1979) Introduction to the algebraic theory of graph grammars (a survey). In: Ng EW, Ehrig H, Rozenberg G (eds) Graph-grammars and their application to computer science and biology, vol 73 of LNCS. Springer, Berlin, pp 1–69
[19]
Ehrig H, Pfender M, Schneider HJ (1973) Graph-grammars: an algebraic approach. In: 14th annual symposium on switching and automata theory, IEEE Computer Society, pp 167–180
[20]
Ghamarian AH, de Mol M, Rensink A, Zambon E, and Zimakova M Modelling and analysis using GROOVE STTT 2012 14 1 15-40
[21]
Guck D, Hatefi H, Hermanns H, Katoen J-P, Timmer M (2014) Analysis of timed and long-run objectives for Markov automata. Logical Methods Comput Sci 10(3:17):1–29 (2014)
[22]
Guck D, Katoen J-P, Stoelinga MIA, Luiten T, Romijn JMT. (2014) Smart railroad maintenance engineering with stochastic model checking. In: Proc of RAILWAYS. Saxe-Coburg Publications
[23]
Garavel H, Lang F, Mateescu R, and Serwe W CADP 2011: a toolbox for the construction and analysis of distributed processes STTT 2013 15 2 89-107
[24]
Heckel R Graph transformation in a nutshell Electr Notes Theor Comput Sci 2006 148 1 187-198
[25]
Hermanns H (2002) Interactive Markov chains: the quest for quantified quality, vol 2428 of LNCS. Springer, Berlin
[26]
Han W, Guo W, Hou Z (2011) Research on the method of dynamic fault tree analysis. In: Proc of ICRMS, pp 950–953
[27]
IEC 61025 International Standard:FaultTreeAnalysis. 2nd edn, 2006-12,Reference number IEC61025:2006(E). International Electrotechnical Commission, Geneva, Switzerland
[28]
Junges S, Guck D, Katoen J-P, Rensink A, Stoelinga M (2015) Fault trees on a diet—automated reduction by graph rewriting. In: Proc of SETTA, vol 9409 of LNCS. Springer, Berlin, pp 3–18
[29]
Junges S, Guck D, Katoen J-P, Stoelinga M (2016) Uncovering dynamic fault trees. In: Proc of DSN, IEEE
[30]
Junges S (2015) Simplifying dynamic fault trees by graph rewriting. Master Thesis, RWTH Aachen University.
[31]
Kaiser B (2005) Extending the expressive power of fault trees. In: Proc of RAMS, IEEE, January, pp 468–474
[32]
Katoen J-P, Zapreev IS, Hahn EM, Hermanns H, and Jansen DN The ins and outs of the probabilistic model checker MRMC Perform Eval 2011 68 2 90-104
[33]
Liu D, Xiong L, Li Z, Wang P, Zhang H (2010) The simplification of cut sequence set analysis for dynamic systems. In: Proc of ICCAE, vol 3, pp 140–144
[34]
Montani S, Portinale L, Bobbio A, Codetta-Raiteri, D (2006) Automatically translating dynamic fault trees into dynamic Bayesian networks by means of a software tool. In: Proc of ARES, pp 6
[35]
Merle G, Roussel J-M (2007) Algebraic modelling of fault trees with priority AND gates. In: Proc of DCDS, pp 175–180
[36]
Merle G, Roussel J-M, Lesage J-J (2010) Improving the efficiency of dynamic fault tree analysis by considering gate FDEP as static. In: Proc European safety and reliability conf. (ESREL), pp 845–851
[37]
Merle G, Roussel J-M, Lesage J-J, and Bobbio A Probabilistic algebraic analysis of fault trees with priority dynamic gates and repeated events IEEE Trans Reliab 2010 59 1 250-261
[38]
Malhotra M and Trivedi KS Dependability modeling using Petri-nets IEEE Trans Reliab 1995 44 3 428-440
[39]
Neuts MF Matrix-geometric solutions in stochastic models—an algorithmic approach 1994 Mineola Dover Publications
[40]
Pullum LL, Dugan JB (1996) Fault tree models for the analysis of complex computer-based systems. In: Proc of RAMS, IEEE, pp 200–207
[41]
Pulungan R, Hermanns H (2008) Effective minimization of acyclic phase-type representations. In: ASMTA, vol 5055 of LNCS. Springer, Berlin, pp 128–143
[42]
Raiteri DC The conversion of dynamic fault trees to stochastic Petri nets, as a case of graph transformation ENTCS 2005 127 2 45-60
[43]
Rongxing D, Guochun W, Decun D (2010) A new assessment method for system reliability based on dynamic fault tree. In: Proc of ICICTA, IEEE, pp 219–222
[44]
Ruijters E and Stoelinga MIA Fault tree analysis: a survey of the state-of-the-art in modeling, analysis and tools Comput Sci Rev 2015 15 16 29-62
[45]
Schneier B (1999) Attack trees: modeling security threats. Dr. Dobb’s J 24(12):21–29
[46]
Sullivan KJ, Dugan JB, Coppit D (1999) The Galileo fault tree analysis tool. In: Proc of Int Symp on fault-tolerant computing, pp 232–235
[47]
Stamatelatos M, Vesely W, Dugan JB, Fragola J, Minarick J, Railsback J (2002) Fault tree handbook with aerospace applications. NASA Headquarters
[48]
Yevkin O 2011 An improved modular approach for dynamic fault tree analysis. In: Proc of RAMS, pp 1–5

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image Formal Aspects of Computing
Formal Aspects of Computing  Volume 29, Issue 4
Jul 2017
192 pages
ISSN:0934-5043
EISSN:1433-299X
Issue’s Table of Contents

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 01 July 2017
Accepted: 22 November 2016
Received: 14 April 2016
Published in FAC Volume 29, Issue 4

Author Tags

  1. Fault tree analysis
  2. Dynamic fault trees
  3. Reliability
  4. Graph rewriting

Qualifiers

  • Research-article

Funding Sources

  • STW-ProRail
  • CDZ
  • EU FP7
  • EU FP7

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)56
  • Downloads (Last 6 weeks)19
Reflects downloads up to 08 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2024)SAFEST: Fault Tree Analysis Via Probabilistic Model Checking2024 Annual Reliability and Maintainability Symposium (RAMS)10.1109/RAMS51492.2024.10457719(1-7)Online publication date: 22-Jan-2024
  • (2024)Modular Criticality Analysis for Dynamic Fault TreesPrinciples of Verification: Cycling the Probabilistic Landscape10.1007/978-3-031-75778-5_13(274-293)Online publication date: 18-Nov-2024
  • (2024)No Risk, No FunFormal Methods10.1007/978-3-031-71177-0_26(447-468)Online publication date: 9-Sep-2024
  • (2022)DFT modeling approach for operational risk assessment of railway infrastructureInternational Journal on Software Tools for Technology Transfer (STTT)10.1007/s10009-022-00652-424:3(331-350)Online publication date: 1-Jun-2022
  • (2019)Formal Verification of Rewriting Rules for Dynamic Fault TreesSoftware Engineering and Formal Methods10.1007/978-3-030-30446-1_27(513-531)Online publication date: 18-Sep-2019
  • (2019)A DFT Modeling Approach for Infrastructure Reliability Analysis of Railway Station AreasFormal Methods for Industrial Critical Systems10.1007/978-3-030-27008-7_3(40-58)Online publication date: 30-Aug-2019
  • (2018)Fast Dynamic Fault Tree Analysis by Model Checking TechniquesIEEE Transactions on Industrial Informatics10.1109/TII.2017.271031614:1(370-379)Online publication date: Jan-2018
  • (2018)Quantitative Analysis of Dynamic Fault Trees by means of Monte Carlo Simulations: Event-Driven Simulation ApproachReliability Engineering & System Safety10.1016/j.ress.2018.07.011180(487-504)Online publication date: Dec-2018
  • (2017)Boosting Fault Tree Analysis by Formal MethodsModelEd, TestEd, TrustEd10.1007/978-3-319-68270-9_19(368-389)Online publication date: 27-Sep-2017
  • (2017)How Much Are Your Geraniums? Taking Graph Conditions Beyond First OrderModelEd, TestEd, TrustEd10.1007/978-3-319-68270-9_10(191-213)Online publication date: 27-Sep-2017
  • Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Full Access

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media