A software system for studying changes in the probability of detecting vulnerabilities in a collaboration strategy in conditions of counteraction to testing.
- “Graph of changes in failure probabilities for given types of attacks at p(ai) = 1.0”.
- “Graph of the probability P(p(t)) of detecting a vulnerability when testing with a separate device”.
- “Graph of the probability P(p(t, k)) of detecting a vulnerability when testing with a separate device”.
- “Graph of the probability of detecting vulnerabilities in a collaboration strategy in conditions of resistance to testing from t”.
- “Graph of the probability of detecting vulnerabilities in a collaboration strategy in conditions of resistance to testing from k”.
- “Generating a 15 x 15 adjacency matrix”.
- “Generating the minimum coverage adjacency matrix”.
-
Table containing estimates of the classification of failure detection situations for various types of attacks:
-
An example of a graph of changes in failure probabilities for given types of attacks with p(ai) = 1.0:
-
An example of a graph of the probability P(p(t)) of detecting vulnerabilities when testing with a separate device:
-
An example of a graph of the probability P(p(t,k)) of detecting vulnerabilities in a collaboration strategy for given values of parameters p(t), n, k:
-
An example of a graph of the probability of detecting vulnerabilities in a collaboration strategy under conditions of resistance to testing from t:
-
An example of a graph of the probability of detecting vulnerabilities in a collaboration strategy in conditions of resistance to testing from k:
-
An example of generating an adjacency matrix with a dimension of 15 x 15 graphs:
-
Generating a minimum coverage adjacency matrix for the original adjacency matrix:
