| 利用矩阵运算实现故障树参数间转化 |
| |
| 引用本文： | 陈金水,蔡佳昆,蔡惠明.利用矩阵运算实现故障树参数间转化[J].天津大学学报(自然科学与工程技术版),2004,37(8):682-685. |
| |
| 作者姓名： | 陈金水 蔡佳昆 蔡惠明 |
| |
| 作者单位： | 天津大学机械工程学院，天津大学机械工程学院，天津大学机械工程学院 天津300072，天津300072，天津300072 |
| |
| 摘 要： | 为减少FTA的NP困难,在充分研究故障树主要参数(最小割集、最小路集、不交化最小割集和不交化最小路集)之间内在联系的基础上,找到了它们间相互转化的方法,并通过割集矩阵的运算加以实现.这些转化方法,为减少NP困难、简化FTA开辟了新途径.
|
| 关 键 词： | 故障树 割集矩阵 不交化 D运算 N运算 |
| 文章编号： | 0493-2137(2004)08-0682-04 |
| 修稿时间： | 2003年2月17日 |
Transformation of Main Parameters by Matrixing Method in FTA |
| |
| CHEN Jin-shui,CAI Jia-kun,CAI Hui-ming.Transformation of Main Parameters by Matrixing Method in FTA[J].Journal of Tianjin University(Science and Technology),2004,37(8):682-685. |
| |
| Authors: | CHEN Jin-shui CAI Jia-kun CAI Hui-ming |
| |
| Abstract: | In order to reduce nondeterministic polynominal (NP) difficulty in fault tree analysis (FTA), on the basis of studying internal relations of main parameters (minimum cut sets, minimum path sets, non-cross minimum cut sets and non-cross minimum path sets) in fault tree system , computation methods in FTA are defined by using Boolean algebra operation rule, and transformations of main parameters are performed by matrixing method.By means of parameterical transformation techniques,several new ways to analyze various fault trees are provided,and these ways are of great importance in the reduction of NP difficulty in FTA. |
| |
| Keywords: | fault tree cut sets matrix non-cross D algorithm N algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
