Journal of Frontiers of Computer Science and Technology ›› 2008, Vol. 2 ›› Issue (2): 123-130.

• 综述·探索 • Previous Articles     Next Articles

Hierarchical Petri nets

HAO Kegang1, DING Jianjie1,2+   

  1. 1. College of Information Science and Technology, Northwest University, Xi’an 710027, China
    2. Department of Math and Physics, Shaanxi Education Institute, Xi’an 710061, China
  • Received:1900-01-01 Revised:1900-01-01 Online:2008-04-20 Published:2008-04-20
  • Contact: HAO Kegang

层次结构的Petri网

郝克刚1,丁剑洁1,2+   

  1. 1. 西北大学 信息科学与技术学院,西安 710027
    2. 陕西教育学院 数理工程系,西安 710061
  • 通讯作者: 郝克刚

Abstract: Petri net is a perfect model to describe and analyze concurrent systems. However, in large or complex applications of the real world, it may run into the problem that the amount of nodes is too large. Colored Petri nets and several hierarchical Petri nets, such as place/transition refinement nets, object nets and open nets are introduced. Also, the methods of deduction of amount of nodes and introduction of hierarchy into models are analyzed and compared. Further, the relations of these models with each other in view of their structures are discussed.

Key words: Petri net, hierarchy, place refinement, transition refinement, object Petri net, colored Petri net, open net

摘要: Petri网是一个很好地描述与分析并行系统的模型。但在实际应用中,如果系统过大或较复杂时,会遇到结点数过多的问题。介绍了着色网和几种层次结构的Petri网,包括位置/转移精化网、对象网以及开放网等;分析和比较了这几种模型用以减少结点数和引入层次结构的方法,而且从结构上讨论了它们相互之间的关系。

关键词: Petri网, 层次结构, 位置精化网, 转移精化网, 对象网, 着色网, 开放网,