8. A system comprising: a graph builder configured to represent an event processing application as an event processing network, being a graph with event processing agents as nodes; a finite state machine generator configured to generate a finite state machine, based on the event processing network, wherein the finite state machine is an over-approximation of the event processing application; a logic expresser configured to express stateful rules and policies that are associated with the event processing application using temporal logic, to yield a temporal representation of the event processing application; a combiner configured to combine the temporal representation and the finite state machine into a model; a statement generator configured to generate a statement associated with at least one user-selected verification-related property of the event processing application, wherein the statement is generated using the temporal representation; and a model checker configured to apply the statement to the model, to yield an indication for: (i) a correctness of the statement or (ii) a counter example, respectively, wherein the graph builder, the finite state machine generator, the logic expresser, the statement generator, and the model checker are in operative associated with at least one processor, wherein the at least one verification-related property of the event processing application is a mutual exclusivity of two of the event processing agents within the graph, and wherein the statement indicates that the two or more of the event processing agents are mutual exclusive such that for any given input, one of the two event processing agents produces a different output from another one of the two event processing agents, at a same point of time, and wherein the counter example is compilable into a sequence of events that contradicts the statement.
8. A system comprising: a graph builder configured to represent an event processing application as an event processing network, being a graph with event processing agents as nodes; a finite state machine generator configured to generate a finite state machine, based on the event processing network, wherein the finite state machine is an over-approximation of the event processing application; a logic expresser configured to express stateful rules and policies that are associated with the event processing application using temporal logic, to yield a temporal representation of the event processing application; a combiner configured to combine the temporal representation and the finite state machine into a model; a statement generator configured to generate a statement associated with at least one user-selected verification-related property of the event processing application, wherein the statement is generated using the temporal representation; and a model checker configured to apply the statement to the model, to yield an indication for: (i) a correctness of the statement or (ii) a counter example, respectively, wherein the graph builder, the finite state machine generator, the logic expresser, the statement generator, and the model checker are in operative associated with at least one processor, wherein the at least one verification-related property of the event processing application is a mutual exclusivity of two of the event processing agents within the graph, and wherein the statement indicates that the two or more of the event processing agents are mutual exclusive such that for any given input, one of the two event processing agents produces a different output from another one of the two event processing agents, at a same point of time, and wherein the counter example is compilable into a sequence of events that contradicts the statement. 12. The system according to claim 8 , wherein the counter example is compilable into a sequence of events, that when applied to the event processing application, triggers the event processing agents that are associated with the verification-related property.