检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]南京理工大学计算机科学与技术学院,南京210094
出 处:《计算机科学》2012年第7期148-153,169,共7页Computer Science
基 金:国家自然科学基金(60803001);中国博士后科学基金特别资助项目(200902517);江苏省博士后基金(0801043B);江苏省高校2010年"青蓝工程"优秀青年骨干教师项目;南京市科技计划重点项目(020142010);南京理工大学2009年紫金之星资助
摘 要:复杂网络安全事件、物联网世系追溯等新型应用为复杂事件的世系研究提出许多挑战。由于模糊时间以及状态不确定性转移等因素的存在,追溯复杂事件的世系时往往出现时间推导不精确以及无法有效逆向推导等问题,因此无法高效地追踪及查询复杂事件的形成世系。针对此类问题,结合起源语义提出了一种基于扩展的模糊时间Petri网的逆向推理模型(BREFTN),并根据时间自动机理论利用此模型设计了逆向推理算法。在给定目标库所以及相关条件的情况下,它不仅可以得到所有演变路径信息并分析其可能性分布,还可以对复杂事件的各个状态及变迁的模糊时间函数值进行有效地推算分析。最后分析了BREFTN模型的完备性及演变路径的性质,并通过实验检测了算法的性能。Some novel applications such as network security lenges for the lineage studying of complex event. Because of event and tracing lineage of IOT, etc. presented many chal the presence of factors including fuzzy time and uncertain transfer of state, tracing the lineage of complex event often encounter inaccurate derived time and hard reverse derivation problem, therefore the evolution lineage of complex event can not be traced or queried effectively. A reverse derivation model with the provenance semantic, called BREFTN (backward reasoning extended fuzzy time petri net), was proposed for such problems,and based on this model, a backward reasoning algorithm according to time automation theory was designed. Given goal place(s) and other conditions, it can not only get all information evolution path and analyze the possibility distribution of path, but also efficiently compute the fuzzy time function value of the state and transition of complex events. Finally, the completeness of BREFTN model and the properties of evolution path were analyzed, and the performance of algorithm was verified by experiments.
关 键 词:复杂事件 世系 模糊时间PETRI网 时间自动机
分 类 号:TP311[自动化与计算机技术—计算机软件与理论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.63