检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]南京航空航天大学计算机科学与技术学院,南京210016
出 处:《计算机科学》2015年第8期198-202,共5页Computer Science
基 金:国家自然科学基金(61100034;61170043);中央高校基本科研业务费专项资金(CXZZ11_0218)资助
摘 要:故障树(Fault Tree,FT)被广泛应用于系统故障的快速定位,但其因缺乏精确的语义信息而存在重复构建问题。将本体引入到故障树领域中,并对如何构建故障树本体及相应的SWRL规则进行了研究:首先采用本体描述语言(Web Ontology Language,OWL)对故障树中的概念及概念之间的关系进行知识表示,构建了一个可共享、可重用、可扩展的故障树领域本体;然后将故障树中事件之间的逻辑关系转化成语义Web规则语言(Semantic Web Rule Language,SWRL);最后将构建的故障树领域本体和SWRL规则放入JESS推理机中进行推理,产生新的知识,用于系统故障的快速定位。实验证明,使用所提出的方法能在解决故障树重复构建问题的同时,不对系统故障的快速定位产生影响。Fault tree (FT) has been widely applied in rapid location of system faults. However, lacking of accurate semantic information makes it hard to avoid the problem of duplicate construction. This paper introduced ontology into fault tree domain and studied how to construct a FT domain ontology and SWRL. First, it proposed a method of knowledge representation of FT with Web ontology language OWL and constructed a FT domain ontology which is shareable, reusable and extensihle. Second, it transformed the logical relationship among events of FT into semantic Web rule language(SWRL). Finally, it put these SWRL rules and the FT ontology into an inference engine JESS. Then new knowledge is produced and it is exploited for the rapid location of system faults. The causes of events can be rapidly and efficiently located in FT. The experiment proves the correctness and effectiveness of proposed method. It can resolve the problem of duplicate construction of FT without any influence on the rapid location of system faults.
分 类 号:TP311[自动化与计算机技术—计算机软件与理论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.222.143.148