This article presents an algorithm for static analysis of termination of active rules with composite events. We refine the concept of triggering graph, including in the graph not only rules, but also events (primitive events and composite events). Our termination algorithm improves the previous termination algorithms, thanks to the notions of composite path and maximal order M path preceding a rule, replacing the classical notion of cycle. Both composite events and overall conditions of rules paths can be taken into account for rules termination analysis. So, much more termination situations can be detected by our algorithm, especially when active rules defined with conjunction events or sequence events are used.
CITATION STYLE
Couchot, A. (2001). Improving termination analysis of active rules with composite events. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2113, pp. 400–409). Springer Verlag. https://doi.org/10.1007/3-540-44759-8_40
Mendeley helps you to discover research relevant for your work.