首页> 外文会议>The Interational Conference on Artificial Intelligence for Engineering 23-25 June 1998, Wuhan, China >Timing Constrain Petri Net with Stochastic Firing Duration and Analytic Calculation of Its Reachability
【24h】

Timing Constrain Petri Net with Stochastic Firing Duration and Analytic Calculation of Its Reachability

机译:具有随机点火时间的时间约束Petri网及其可达性的解析计算

获取原文
获取外文期刊封面目录资料

摘要

Timing constrain petri net with stochastic firing durating is introduced in this paper, which can be used to unified description of strong and weak firing mode of petri net. The new net and its probability reachability analysis are employed in specification easily of time-critical system and evaluating analytically the scheduling methods.
机译:介绍了具有随机触发时长的时序约束Petri网,可用于统一描述Petri网的强,弱触发方式。新的网络及其概率可达性分析可轻松地用于时间紧迫的系统的规格说明中,并通过分析评估调度方法。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号