Sort Of Binary Decision Diagram Optimization And Fault Tree Methods For Transforming

With the increasing complexity of computer hardware and software systems to ensure the accuracy and reliability of systems, and more important, for the many theories and methods of detection model with its clear, concise and a high degree of automation and attention.Papers on the Binary decision diagram and study the basic principles of the status quo, Aginst affecting factors of the structure -variable sort conducted in-depth analysis, an improving idea thatoptimize the scale of node of bdd is proposed. Research on the use of dynamic exchange to complete the path optimization of the number of methods proposed OSMNP sort Optimization. The algorithm path through the nodes and the definition of records, and the exchange of local variables in the path of change to the overall change in the transfer, the number of paths to achieve optimization. Papers also studied the proble of the transformation and sort based on the fault tree analysis , a rapid and effective method of LNPC proposed, the method adopted the strategy of gradual decomposition of the incident directly to complete the order and combination of one-time to achieve fault tree to the transformation of BDD and optimization, and through examples demonstrate its effectiveness.OSMNP algorithm using the effective exchange of variables adjacent properties access to at least sort of path; LNPC algorithm by the rules, by definition, traversing the fault tree at the end of the incident not only completed the optimization sort, but also the effective realization of the fault tree to the transformation of BDD, These research results of BDD application of a better in-depth theoretical and a practical value.