G-CAS: Greedy Algorithm-Based Security Event Correlation System for Critical Infrastructure Network

Algorithm 1

The greedy algorithm.

	Require: problem.
Ensure: solution to the problem.
(1)	if Get a problem then
(2)	Decompose the problem.
(3)	fordo
(4)	Compare all the solutions for .
(5)	Get the best solution: .
(6)	Put into the .
(7)	Combine all the from 1 to .
(8)	Adjust and optimize all the .
(9)	end for
(10)	Adjust and optimize the whole solution.
(11)	end if
(12)	return The best solution.