含环触发图对应的主动规则集可终止性分析  

Termination Analysis of Active Rule Based on Dependency Set

作　　者：郝忠孝 [1] 任超 [2] 赵龄强 [3] 

机构地区：[1]哈尔滨理工大学计算机与控制学院,哈尔滨,150080,齐齐哈尔大学计算机学院,齐齐哈尔,161006,哈尔滨工业大学计算机科学与技术学院,哈尔滨,150001 [2]空军装备研究院航空气象研究所4室,北京,100085 [3]哈尔滨理工大学计算机与控制学院,哈尔滨,150080

出　　处：《计算机研究与发展》2005年第12期2199-2205,共7页Journal of Computer Research and Development

基　　金：黑龙江省自然科学基金项目(F00-06)~~

摘　　要：主动规则集的可终止性是主动数据库规则集的三大重要特征之一·主动规则集可否保证终止将直接影响到系统的应用·由于主动规则间存在依赖关系,通过对依赖关系的分析,给出了规则的触发传递闭包、依赖传递闭包等概念·以此为基础,提出了用规则触发-依赖图(T-DG)方法来分析主动规则集的终止性·特别讨论了判定含环的触发图(TG)对应的主动规则集是否保证终止的方法,给出了相应的判定算法、算法证明及分析·Termination of active rule set is one of the three important characteristics of active database rule sets. It will directly influence the application of active database systems. By analysis of dependency relationship, which exists among the active rules, such concepts are given as triggering-transition closure, dependency-transition closure etc. Based on these concepts, an approach is supposed to analyze termination of active rule set by triggering-dependency graph （T-DG） of active rules. Especially, the approach deciding termination of the active rule set corresponding to a triggering-graph （TG） is studied, which includes a cycle. Also given are the corresponding deciding algorithms, verification and analysis of the algorithms.

关 键 词：主动数据库 ECA规则 规则触发-依赖图 触发图 终止性分析 

分 类 号：TP311.13[自动化与计算机技术—计算机软件与理论]