Rule Termination Analysis based on Petri Nets (1996) [1 citations — 1 self]
|
Abstract:
In this paper, we propose a method for compile-time termination analysis of rules in active database systems based on Petri nets. Petri nets provide a formalism, which can be used to model the behaviour of rules much more precisely than known from literature. So not only the mutual triggering, mutual activation and priorities of rules (see [BCP95]) may be considered but also many other parts of the rule execution model. As our analysis technique considers all the semantics expressed in a Petri net, we are able to enhance the results of all termination analysis methods known to us. Additionally our method has not been developed with a special rule model in mind, but is applicable for a broad range of active database systems. As the Petri nets can be generated automatically from rule definitions, there is no additional specification overhead for the rule programmer. 1
Citations
| 555 | Petri Net Theory and the Modeling of Systems – Peterson - 1981 |
| 70 | Active database systems – Dayal, Hanson, et al. - 1995 |
| 51 | An overview of production rules in database systems – Hanson, Widom - 1993 |
| 39 | Improved Rule Analysis by Means of Triggering and Activation Graphs – Baralis, Ceri, et al. - 1995 |
| 32 | Active Object Systems – Buchmann - 1994 |
| 26 | Behaviour of database production rules: Termination, confluence, and observable determinism – AIKEN, WIDOM, et al. - 1992 |
| 25 | Termination Analysis for Active Databases – Baralis, Ceri, et al. - 1993 |
| 14 | Events in an active object-oriented database – GATZIU, K - 1994 |
| 3 | der Voort and A. Siebes. Termination and Confluence of Rule Execution – van - 1994 |
| 2 | Rule Termination Analysis based on a Rule Meta Model – Zimmer - 1995 |
