检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:刘绘珍[1] 张力[1] 王以群[1] 赵贺永[1]
出 处:《工业安全与环保》2006年第4期58-59,共2页Industrial Safety and Environmental Protection
基 金:国家自然科学基金资助项目(70271016);国防军工技术基础计划项目(Z012002A001;Z012005A001)
摘 要:介绍了故障树分析的基本概念,对其中用到的最小割集和最小径集做了详细的说明。介绍求最小割集和最小径集的传统方法,并在此基础上提出一种新的方法。此方法把故障树转换为串并联系统或并串联系统的形式。转换后的形式可以很容易地得出最小割集和最小径集。并用例子进行了详细的说明。Some basic conceptions of fault tree analysis are described, especially least cut set and least path set used in it. Usual ways to get least cut set and least path set are introduced and one kind of new way is raised, in which fault tree is considered to be converted into the form of series - parallel connection and parallel - series connection system and least cut set and least path set can be easily obtained in such convetted form. Examples are also cited in the paper in detail to make further explanation.
分 类 号:X928.0[环境科学与工程—安全科学]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.3