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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
