A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
Iranian Journal of Electrical & Electronic Engineering
Intruders often combine exploits against multiple vulnerabilities in order to break into the system. Each attack scenario is a sequence of exploits launched by an intruder that leads to an undesirable state such as access to a database, service disruption, etc. The collection of possible attack scenarios in a computer network can be represented by a directed graph, called network attack graph (NAG). The aim of minimization analysis of network attack graphs is to find a minimum critical set offatcat:5wejpw6fwfc6na35f7uv3tyxua