首页> 外文期刊>Computers & operations research >Solving large interval availability models using a model transformation approach
【24h】

Solving large interval availability models using a model transformation approach

机译:使用模型转换方法求解大间隔可用性模型

获取原文
           

摘要

Fault-tolerant systems are often modeled using (homogeneous) continuous time Markov chains (CTMCs). Computation of the distribution of the interval availability, i.e. of the distribution of the fraction of time in a time interval in which the system is operational, of a fault-tolerant system modeled by a CTMC is an important problem which has received attention recently. However, currently available methods to perform that computation are very expensive for large models and large time intervals. In this paper, we develop a new method to compute the distribution of the interval availability which, for large enough models and large enough time intervals, is significantly faster than previous methods. In the method, a truncated transformed model, which has with some arbitrarily small error the same interval availability distribution as the original model, is obtained from the original model and the truncated transformed model is solved using a previous state-of-the-art method. The method requires the selection of a "regenerative" state and its performance depends on that selection. For a class of models, including typical failure/repair models of coherent fault-tolerant systems with exponential failure and repair time distributions and repair in every state with failed components, a natural selection for the regenerative state exists and theoretical results are available assessing the performance of the method for that natural selection in terms of "visible" model characteristics. Those results can be used to anticipate when the method can be expected to be competitive for models in that class. Numerical results are presented showing that the new method can indeed be significantly faster than a previous state-of-the-art method and is able to deal with some large models and large time intervals in reasonable CPU times.
机译:容错系统通常使用(均匀)连续时间马尔可夫链(CTMC)进行建模。由CTMC建模的容错系统的间隔可用性的分布(即,系统在其中运行的时间间隔中的时间部分的分布)的计算是一个重要的问题,该问题最近受到关注。但是,对于大型模型和较大的时间间隔,执行该计算的当前可用方法非常昂贵。在本文中,我们开发了一种新的方法来计算间隔可用性的分布,对于足够大的模型和足够大的时间间隔,此方法比以前的方法要快得多。在该方法中,从原始模型中获得了截断的变换模型,该截断的变换模型具有与原始模型相同的间隔可用性分布,并且具有任意小的误差,并且该截断的变换模型使用先前的现有技术方法进行了求解。 。该方法需要选择“再生”状态,其性能取决于该选择。对于一类模型,包括具有指数故障和相干故障时间分布的相干容错系统的典型故障/修复模型,以及在具有故障组件的每个状态下进行维修的时间分布,存在针对再生状态的自然选择,并且可获得评估性能的理论结果根据“可见”模型特征进行自然选择的方法。这些结果可用于预测何时该方法可以预期与该类别的模型竞争。数值结果表明,新方法的确可以比以前的最新方法快得多,并且能够在合理的CPU时间内处理某些大型模型和较大的时间间隔。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号