基于时间自动机的ECA规则交互问题研究  

RESEARCH ON ECA RULES INTERACTION PROBLEMS BASED ON TIMED AUTOMATA

作　　者：赵鑫[1] 卢涛[1] 

机构地区：[1]大连理工大学管理与经济学部,辽宁大连116024

出　　处：《计算机应用与软件》2017年第2期74-79,共6页Computer Applications and Software

基　　金：国家自然科学基金项目(71271038)

摘　　要：Event-Condition-Action(ECA)规则的评估和执行独立于其他规则,但规则行为间交互作用可能导致系统行为不可预测或不安全。典型的问题有规则的不一致性和终止性。针对上述问题,提出将ECA规则转换为时间自动机,对规则之间的交互进行分析。采用时间自动机验证工具UPPAAL验证规则集合是否存在交互问题。以痴呆老人智能辅助系统为例,实验结果证明了该方法的可行性和有效性。The evaluation and execution of each Event-Condition-Action（ECA） rule is considered to be independent from the others. But interactions of rule actions can cause the system behaviors to be unpredictable or unsafe. Typical problems are inconsistencies,and termination problems among rules. In response to these problems,the ECA rule is proposed to be converted into timed automata to analyze the interaction of rules. Then,a verification tool of timed automata which is named UPPAAL is used to verify the interaction problem among the rules set. A case of smart assisting system for dementia is used to prove this method. Experimental results demonstrate the feasibility and effectiveness of this method.

关 键 词：ECA规则 时间自动机 转换 UPPAAL 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]