Termination Analysis of Active Rules with Priorities

This paper presents an algorithm for termination static analysis of active ruleswith priorities. Active rules termination is an undecidable problem. Several recent workshave suggested proving termination by using the concept of triggering graph. We proposehere a refinement of these works, exploiting the priorities defined between rules. Weintroduce the notions of path set and destabilizing set. We show how to determine thepriority of a path set. The triggering graph can then be reduced thanks to considerationsabout priorities of the path sets. Much more termination situations can be detected, sincepriorities are exploited