United Formula to Determine Acyclic Execution Paths
Hao Zhong-xiao · Harbin Ligong Daxue xuebao · 2004
No cycles in TG is a sufficient condition of the termination of rule sets, but it is not a necessary condition. Because if there are cycles in the TG, the rule set may terminate if these cycles can only be executed a finite number of times. Through static analysis for active database rule sets, we present the concept of united formula and the algorithm to determine whether the united formula is satisfied. We also present the time complexity analysis of the algorithm. It is the base of determining termination of cyclic trigger graphs.