Abstract
AbstractDynamic fault tree (DFT) is a reliable method for modeling complex systems with dynamic characteristics. However, evaluating the reliability of such systems can be complex. The sequential binary decision diagram (SBDD) method simplifies this process by reducing computational complexity. This study investigates factors influencing SBDD size and proposes a new method, the complete priority ordering method, for ordering basic events in SBDDs. Results demonstrate the method's effectiveness in comparison to existing approaches.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
