首页> 外文会议>International conference on computer aided systems theory >Algorithm for Computing Unfoldings of Unbounded Hybrid Petri Nets
【24h】

Algorithm for Computing Unfoldings of Unbounded Hybrid Petri Nets

机译:计算杂交培养网的计算展开的算法

获取原文

摘要

The paper formalizes the concept of the unfolding for unbounded hybrid Petri nets and introduces the algorithm for its computing. The unfolding is a useful partial-order based method for analysis and verification of the Petri net properties. This technique can cope well with the so-called state space explosion problem, especially for the Petri nets with a lot of concurrency.
机译:本文规范了无限的混合培养网展开的概念,并向其计算介绍了算法。展开是一种有用的基于零阶的分析和验证Petri网属性的方法。这种技术可以与所谓的状态空间爆炸问题很好,特别是对于具有大量并发性的培养网。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号