...
首页> 外文期刊>IEEE Transactions on Software Engineering >Approximate mean value analysis for stochastic marked graphs
【24h】

Approximate mean value analysis for stochastic marked graphs

机译:随机标记图的近似平均值分析

获取原文
获取原文并翻译 | 示例
           

摘要

An iterative technique for the computation of approximate performance indices of a class of stochastic Petri net models is presented. The proposed technique is derived from the mean value analysis algorithm for product-form solution stochastic Petri nets. In this paper, we apply the approximation technique to stochastic marked graphs. In principle, the proposed technique can be used for other stochastic Petri net subclasses. In this paper, some of these possible applications are presented. Several examples are presented in order to validate the approximate results.
机译:提出了一种计算一类随机Petri网模型的近似性能指标的迭代技术。所提出的技术源自产品形式解决方案随机Petri网的均值分析算法。在本文中,我们将逼近技术应用于随机标记图。原则上,提出的技术可以用于其他随机Petri网子类。本文介绍了其中一些可能的应用程序。给出了几个例子,以验证近似结果。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号