首页> 外国专利> Efficiently evaluate the method and system the minimum cut set of the fault tree

Efficiently evaluate the method and system the minimum cut set of the fault tree

机译:有效评估方法和系统故障树的最小割集

摘要

PROBLEM TO BE SOLVED: To reduce computational complexity in minimum cut set (MCS) evaluation for a tree of a failure including k/n gates and to improve reliability in a result of the MCS evaluation for the tree of the failure.;SOLUTION: A system for evaluating minimum cut sets (MCSs) of a tree of a failure is provided. The evaluation system includes composite k/n gate simplification means which reduces composite k/n gates into basic k/n gates on the basis of a collection of simplification rules, and basic k/n gate minimization means which reduces the basic k/n gates into minimum k/n gates on the basis of a collection of minimization rules.;COPYRIGHT: (C)2012,JPO&INPIT
机译:解决的问题:减少包括k / n门的故障树的最小割集(MCS)评估的计算复杂度,并提高对故障树的MCS评估结果的可靠性。提供了一种用于评估故障树的最小割集(MCS)的系统。该评估系统包括:复合k / n门简化装置,可根据一系列简化规则将复合k / n门减少为基本k / n门;以及基本k / n门最小化装置,可将基本k / n门减少在最小化规则集合的基础上最小化k / n个门。;版权:(C)2012,JPO&INPIT

著录项

  • 公开/公告号JP5601468B2

    专利类型

  • 公开/公告日2014-10-08

    原文格式PDF

  • 申请/专利权人 日本電気株式会社;

    申请/专利号JP20100263181

  • 发明设计人 矢野尾 一男;向 剣文;

    申请日2010-11-26

  • 分类号G06Q50/04;

  • 国家 JP

  • 入库时间 2022-08-21 16:13:30

相似文献

  • 专利
  • 外文文献
  • 中文文献
获取专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号