首页> 外文OA文献 >PL-MODT and PL-MODMC : two codes for reliability and availability analysis of complex technical systems using the fault tree modularization technique
【2h】

PL-MODT and PL-MODMC : two codes for reliability and availability analysis of complex technical systems using the fault tree modularization technique

机译:pL-mODT和pL-mODmC:使用故障树模块化技术对复杂技术系统进行可靠性和可用性分析的两个代码

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

The methodology used in the PL-MOD code has been extended to include the time-dependent behavior of the fault tree components. Four classes of components are defined to model time-dependent fault tree leaves. Mathematical simplifications are applied to predict the time-dependent behavior of simple modules in the fault tree from its input components' failure data. The extended code, PL-MODT, handles time-dependent problems based on the mathematical models that have been established. An automatic tree reduction feature is also incorporated into this code. This reduction is based on the Vesely-Fussell importance measure that the code calculates. A CUT-OFF value is defined and incorporated into the code. Any module or component in the fault tree whose V-F importance is less than this value will automatically be eliminated from the tree. In order to benchmark the PL-MODT code, a number of systems are analyzed. The results are in good agreement with other codes, such as FRANTIC and KITT. The computation times are comparable and in most of the cases are even lower for the PL-MODT code compared to the others. In addition, a Monte-Carlo simulation code (PL-MODMC) is developed to propagate uncertainties in the failure rates of the components to the top event of a fault tree. An efficient sorting routine similar to the one used in the LIMITS code is employed in the PL-MODMC code. Upon modularization the code proceeds and propagates uncertainties in the failure rates through the tree. Large fault trees such as the LPRS fault tree as well as some smaller ones have been analyzed for simulation, and the results for the LPRS are in fair agreement with the WASH-1400 predictions for the number of simulations performed. The codes PL-MODT and PL-MODMC are written in PL/l language which offers the extensive use of the list processing tools. First experience indicates that these codes are very efficient and accurate, specifically for the analysis of very large and complex fault trees
机译:PL-MOD代码中使用的方法已扩展为包括故障树组件的时间相关行为。定义了四类组件来对与时间相关的故障树叶子进行建模。通过数学简化,可以从故障树的输入组件的故障数据中预测简单模块在时间上的行为。扩展代码PL-MODT基于已建立的数学模型处理与时间有关的问题。此代码中还包含了自动减少树功能。这种减少是基于代码计算的Vesely-Fussell重要性度量。定义了一个CUT-OFF值并将其合并到代码中。 V-F重要性小于此值的故障树中的任何模块或组件都将自动从树中删除。为了对PL-MODT代码进行基准测试,分析了许多系统。结果与其他代码(例如FRANTIC和KITT)非常吻合。 PL-MODT代码的计算时间是可比的,并且在大多数情况下甚至比其他情况要短。此外,开发了蒙特卡洛仿真代码(PL-MODMC),以将组件故障率的不确定性传播到故障树的最高事件。 PL-MODMC代码中采用了一种与LIMITS代码中使用的排序程序类似的有效排序程序。模块化后,代码将继续进行,并通过树传播故障率的不确定性。已对大型故障树(例如LPRS故障树)以及一些较小的故障树进行了仿真分析,并且LPRS的结果与执行的仿真次数与WASH-1400的预测基本吻合。代码PL-MODT和PL-MODMC用PL / l语言编写,可广泛使用列表处理工具。初步经验表明,这些代码非常有效且准确,特别是用于分析非常大和复杂的故障树

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号