首页> 外文会议>18th IEEE International Symposium on Modeling, Analysis Simulation of Computer and Telecommunication Systems >A Symbolic Reachability Graph and Associated Markov Process for a Class of Dynamic Petri Nets
【24h】

A Symbolic Reachability Graph and Associated Markov Process for a Class of Dynamic Petri Nets

机译:一类动态Petri网的符号可达图及相关马尔可夫过程

获取原文

摘要

The design of evolving discrete-event systems needs for adequate modeling techniques. A Petri net-based reflective layout has been recently proposed to support dynamic discrete event systemȁ9;s design. Keeping functional aspects separated from evolutionary ones, deploying changes to the (current) system configuration when necessary, results in a clean formal model preserving the ability of verifying properties typical of Petri nets. Reflective Petri nets are provided with a pseudo-symbolic state transition graph, and an associated lumped Markov process.
机译:不断发展的离散事件系统的设计需要适当的建模技术。最近提出了一种基于Petri网的反射式布局,以支持动态离散事件系统的设计[9]。将功能方面与进化方面隔离开来,在必要时将更改部署到(当前)系统配置中,会形成一个干净的正式模型,从而保留了验证Petri网典型特性的能力。反射Petri网具有伪符号状态转移图和相关的集总马尔可夫过程。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号