首页> 外文期刊>Performance Evaluation >Marking dependency in non-Markovian stochastic Petri nets
【24h】

Marking dependency in non-Markovian stochastic Petri nets

机译:非马尔可夫随机Petri网中的标记依赖性

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

摘要

Marking dependency is a powerful tool that allows different firing time distributions to be associated with a stochastic Petri net transition, depending on the marking. Through this feature, the modeler can easily and compactly represent advanced properties and behaviors of the system. While a semantics and specific solution techniques have been provided for generalized stochastic Petri nets thus covering homogeneous Markovian aspects, in the non-homogeneouson-Markovian case marking dependency still needs to be investigated. To fill this gap, this paper provides a formalization of marking dependent semantics in non-Markovian stochastic Petri nets (NMSPNs) and a solution technique, based on phase type distributions and Kronecker algebra, able to deal with such a feature allowing both transient and steady-state analyses. To motivate the actual need of marking dependency in NMSPN modeling and to demonstrate the potential of such a feature as well as the validity of the proposed solution technique a case study on a multi-core CPU system with power management facilities is explored. (c) 2017 Elsevier B.V. All rights reserved.
机译:标记依赖性是一个强大的工具,可以根据标记将不同的触发时间分布与随机的Petri网过渡相关联。通过此功能,建模者可以轻松,紧凑地表示系统的高级属性和行为。尽管已经为广义随机Petri网提供了语义和特定的解决技术,从而覆盖了齐次Markovian方面,但在非齐次/非Markovian情况下,标记依赖仍然需要研究。为了填补这一空白,本文提供了非马尔可夫随机Petri网(NMSPN)中标记相关语义的形式化以及基于相类型分布和Kronecker代数的解决技术,该技术能够处理允许瞬时和稳定的特征状态分析。为了激发NMSPN建模中标记依赖的实际需求,并证明这种功能的潜力以及所提出的解决方案技术的有效性,对具有电源管理功能的多核CPU系统进行了案例研究。 (c)2017 Elsevier B.V.保留所有权利。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号