In order for fault tree analysis (FTA) to be useful in the assessment and control of risk, the synthesis of the trees should be: 1) Routine -- so that project engineers, etc. will use it. 2) Rapid -- so that it won't slow down the project. 3) Accurate -- so that the results will have some meaningful relationship to the actual risk. 4) Flexible -- so that the synthesis procedure could be used on a wide range of systems. We present an algorithm which uses directed graph (digraph) models of the cause and effect relationships between variables and events. Given the models, the algorithm will deduce the combinatorially correct fault tree for the system. The models and the algorithm are described and tested on two examples.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    The Synthesis of Fault Trees


    Additional title:

    Sae Technical Papers


    Contributors:

    Conference:

    1978 Automotive Engineering Congress and Exposition ; 1978



    Publication date :

    1978-02-01




    Type of media :

    Conference paper


    Type of material :

    Print


    Language :

    English





    Migrating Fault Trees to Decision Trees for Real Time Fault Detection on International Space Station

    Lee, C. / Alena, R. L. / Robinson, P. et al. | British Library Conference Proceedings | 2005


    Using Disjoint Sets in Fault Trees

    Twigg, D. / System Safety Society (U.S.) | British Library Conference Proceedings | 2006


    A Knowledge Based Approach to Fault Trees

    Nicholson, David T. / Wells, James D. / Dunn, LeeAnne | SAE Technical Papers | 1987


    Dynamic fault trees: semantics, analysis and applications

    Volk, Matthias | TIBKAT | 2022

    Free access