计算机科学 ›› 2011, Vol. 38 ›› Issue (2): 55-58.

• 计算机网络与信息安全 • 上一篇    下一篇

稳定有界Petri网的进程表达式

汪明新,刘关俊,闫春钢   

  1. (同济大学计算机科学与工程系 上海201804)(同济大学嵌入式系统与服务计算教育部重点实验室 上海201804)
  • 出版日期:2018-11-16 发布日期:2018-11-16
  • 基金资助:
    本文受国家重点研究发展计划课题(2010CB328101),国家,"八六三”高技术研究发展计划基金项目(2009AA01Z401),国家自然科学基金项目(90718012)和上海市基础研究重点项目(08JC1419300)资助。

Process Expression of Stable Bounded Petri Nets

WANG Ming-xin,LIU Guan-jun,YAN Chun-gang   

  • Online:2018-11-16 Published:2018-11-16

摘要: 文献[1]证明一个有界Pctri网的进程表达式是以该网的基本子进程集为字母表的正规表达式,然而没有给出基本子进程的求解方法。定义了一类有界Petri网—稳定有界Petri网,并给出其基本子进程的求解算法,进而利用有限自动机的语言表达式的求解方法来求解稳定有界Pctri网的进程表达式。另外,还给出了由符合一定条件的导网的进程表达式来构造其同步合成网的进程表达式的算法。

关键词: 有界Petri网,进程表达式,基本子进程,S网

Abstract: The paper[1]proved that the process expression of a bounded Petri net is a regular expression with the basic subprocess set of the net system as alphabet. However, methods for the solution of the basic subprocess set have not been proposed so far. This paper defined a class of bounded Petri nets that are named by stable bounded Petri nets(SB-PNs). A method was presented to compute the set of basic subprocesscs, and then the process expression of an SBPN could be produced by a finite state machine with the basic subprocess set of the net system as alphabet. Next, an algorithm was proposed to construct the process expression of a Petri net synchronized by a set of S-nets.

Key words: Bounded pctri net, Process expression, Basic subprocess, S-net

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!