Attack graph analysis is an effective tool for analyzing network vulnerability

representing the process that attackers penetrate networks using the complex interdependence between vulnerabilities and network configurations.In this paper

we prove the equivalence of the optimization security measure problem and the weighted hitting set problem

and present the method which converts the optimization security measure problem to the weighted hitting set problem on the premise of not increasing the problem scale.Theoretical analysis and experiments show that the method based on conversion has better performance than the method based on critical attack sets in converging to the global optimal solution.