【24h】

Ergodic theory of stochastic decision free Petri nets

机译:随机无决策Petri网的遍历理论

获取原文

摘要

The class of decision-free Petri nets under stochastic timingassumptions, also known as stochastic event graphs, is considered. Underthe assumption that the variables used for the timing of an event graphform stationary and ergodic sequences of random variables, use is madeof an associated stochastic recursive equation in order to construct theevent graph's stationary and ergodic regime. In particular, theconditions under which the existence of this regime is guaranteed aredetermined
机译:考虑了随机时序假设下的无决策Petri网类别,也称为随机事件图。在假设用于事件图定时的变量形成随机变量的平稳和遍历序列的情况下,使用相关联的随机递归方程来构造事件图的平稳和遍历状态。尤其要确定保证该制度存在的条件

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号