L.Voort and A.Siebes, "Termination and confluence of rule execution", Proc 2nd International Conf on Information and Knowledge Management, Nov 1993. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Detecting Termination of Active Database Rules Using Symbolic.. - Ray, Ray (Correct)
....on how one important property of active database systems, namely, termination of active database rules, can be formally verified using symbolic model checking. Detecting termination of active database rules is, in general, an undecidable problem. However, researchers have proposed conditions [2, 12, 13] which are sufficient to ensure termination. Thus, a given problem can be analyzed to check whether it satisfies these conditions; if it does then the rule sets are guaranteed to terminate, otherwise they may or may not. One such condition is the acyclicity of the triggering graph [2] Absence of ....
....not have an incoming activation or triggering edge is removed together with its outgoing edges. If all the vertices are removed in the process, the rule set is indeed terminating. Rule analysis focussing on the termination and confluence properties have also been proposed by Van der Voort et al. [13]. The authors base their work on object oriented database and propose a design theory which they use to ascertain whether the rules are terminating and or confluent. The focus is on deciding termination in a fixed number of steps. The rule model used is very restrictive rule actions can only ....
L. van der Voort and A. Siebes. Termination and Confluence of Rule Execution. In Proceedings of the 2nd International Conference on Information and Knowledge Management, pages 245--255, Washington, DC, November 1993.
Using Petri Nets for Rule Termination Analysis - Detlef Zimmer Axel (1996) (2 citations) (Correct)
....[Gat94, Zim95] Petri nets are used to model possible rule execution traces which are analysed for termination. The information about the interactions between the rules may be taken directly from the rule definitions or from the results of other rule termination analysis techniques, as e.g. [BW94, VS94]. As the Petri nets can be generated automatically there will be no additional specification overhead for the rule programmer (for further details see [ZMU96] 1 2 Basic Definitions In this section we introduce a simple model of an active database, for which we will present our termination ....
....complexity. 6 Related Work Research in the area of rule termination analysis has been quite extensive. But many of the existing analysis algorithms have the disadvantage, that they exploit special semantics of the underlying database system, e.g. they only consider implicit events, i.e. CA rules [BW94, VS94], they heavily rely on the underlying data model (relational object oriented) and moreover impose some other restrictions. A more generally applicable approach is presented in [BCP95] It is based on the search for cycles in graphs which reflect the triggering dependencies and the changing of a ....
[Article contains additional citation context not shown here]
L. van der Voort and A. Siebes. Termination and Confluence of Rule Execution. In 2nd International Conference on Information and Knowledge Mangement, 1994.
Unrolling Cycle to Decide Trigger Termination - Sin Yeung Lee (1999) (1 citation) (Correct)
No context found.
L.Voort and A.Siebes, "Termination and confluence of rule execution", Proc 2nd International Conf on Information and Knowledge Management, Nov 1993.
Programming Systems for Autonomy - Alexander Konstantinou Yechiam (2003) (Correct)
No context found.
L. Van Der Voort and A. Siebes. Termination and confluence of rule execution. In 2nd International Conference on Information and Knowledge Management (CIKM 93), Washington, DC, 1993.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC