A Compositional Semantics for Dynamic Fault Trees in Terms of Interactive Markov Chains

Dynamic fault trees (DFTs) are a versatile and common formalism to model and analyze the reliability of computer-based systems. This paper presents a formal semantics of DFTs in terms of input/output interactive Markov chains (I/O-IMCs), which extend continuous-time Markov chains with discrete input, output and internal actions. This semantics provides a rigorous basis for the analysis of DFTs. Our semantics is fully compositional, that is, the semantics of a DFT is expressed in terms of the semantics of its elements (i.e. basic events and gates). This enables an efficient analysis of DFTs through compositional aggregation, which helps to alleviate the state-space explosion problem by incrementally building the DFT state space. We have implemented our methodology by developing a tool, and showed, through four case studies, the feasibility of our approach and its effectiveness in reducing the state space to be analyzed.

[1]  Kishor S. Trivedi,et al.  Dependability modeling using Petri-nets , 1995 .

[2]  Kuo-Chung Tai,et al.  An incremental approach to reachability analysis of distributed programs , 1993, Proceedings of 1993 IEEE 7th International Workshop on Software Specification and Design.

[3]  Suprasad V. Amari,et al.  A new approach to solve dynamic fault trees , 2003, Annual Reliability and Maintainability Symposium, 2003..

[4]  Salvatore J. Bavuso,et al.  Dynamic fault-tree models for fault-tolerant computer systems , 1992 .

[5]  Mario Bravetti,et al.  The theory of interactive generalized semi-Markov processes , 2002, Theor. Comput. Sci..

[6]  Mariëlle Stoelinga,et al.  Dynamic Fault Tree Analysis Using Input/Output Interactive Markov Chains , 2007, 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN'07).

[7]  Holger Hermanns,et al.  Interactive Markov Chains , 2002, Lecture Notes in Computer Science.

[8]  Joanne Bechta Dugan,et al.  A discrete-time Bayesian network reliability modeling and analysis framework , 2005, Reliab. Eng. Syst. Saf..

[9]  Nancy A. Lynch,et al.  An introduction to input/output automata , 1989 .

[10]  Mariëlle Stoelinga,et al.  Coral: a tool for Compositional Reliability and Availability analysis† , 2007 .

[11]  David Coppit,et al.  Formal Semantics for Computational Engineering: A Case Study on Dynamic Fault Trees , 2000 .

[12]  Christel Baier,et al.  Efficient Computation of Time-Bounded Reachability Probabilities in Uniform Continuous-Time Markov Decision Processes , 2005, TACAS.

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

[14]  Pepijn Crouzen.  Compositional Analysis of Dynamic Fault Trees using Input/Output Interactive Markov Chains , 2006 .

[15]  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.

[16]  Holger Hermanns,et al.  Uniformity by Construction in the Analysis of Nondeterministic Stochastic Systems , 2007, 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN'07).

[17]  Joanne Bechta Dugan,et al.  DIFtree: a software package for the analysis of dynamic fault tree models , 1997, Annual Reliability and Maintainability Symposium.

[18]  H. Boudali,et al.  A new Bayesian network approach to solve dynamic fault trees , 2005, Annual Reliability and Maintainability Symposium, 2005. Proceedings..

[19]  Holger Hermanns,et al.  On Combining Functional Verification and Performance Evaluation Using CADP , 2002, FME.

[20]  Joost-Pieter Katoen,et al.  Automated compositional Markov chain generation for a plain-old telephone system , 2000, Sci. Comput. Program..