In this papaer, we propose new methods for the compile-time analysis of the behavior of active rules, based on the distinction between mutual triggering and mutual activation of rules. This distinction motivates the introduction of the graphs defining rule interaction, called triggering and activation graphs respectively. Analysis techniques presented in this paper are focused on the problem of termination; results provide a systematic identification of reactive behaviors which can be guaranteed to terminate and reactive behaviors which may lead to infinite rule processing.