Minimum Cut Set Solving Method Based on Petri Net and Improved Binary Decision Diagram

This paper proposes an algorithm for generating minimum cut set based on Petri net and improved binary decision diagram (BDD). In this algorithm, the fault trees are transformed into Boolean logic relations through Petri net, and then the Boolean logic relations are transformed into graphic expressions by improved BDDs. Finally, the minimum cut set are obtained by depth first search traversal. The algorithm is verified by the application in the independent ring power grid, and the results show that the minimum cut set can be found quickly and accurately, which embodies the superiority of solving the minimum cut set of complex fault tree.