计算机科学 ›› 2017, Vol. 44 ›› Issue (Z6): 543-545.doi: 10.11896/j.issn.1002-137X.2017.6A.121

• 综合、交叉与应用 • 上一篇    下一篇

出现网的t型s切和t切

刘萍   

  1. 甘肃民族师范学院计算机科学系 合作747000
  • 出版日期:2017-12-01 发布日期:2018-12-01
  • 基金资助:
    本文受甘肃民族师范学院院长基金(2013-16)资助

On t-type s Cuts and t Cuts of Occurrence Nets

LIU Ping   

  • Online:2017-12-01 Published:2018-12-01

摘要: 首先引入出现网的t切的转移的概念,利用t切的转移集τ,可以得到t切p[τ]。其次引入s切的伴随集E(u)和t型s切的概念。证明了出现网的t型s切和t切有对应的关系以及这种对应关系保持t型s切的转移和t切的转移。给出了在s切有向图中查找t切的算法,证明了出现网的t切都是t型s切的伴随集。

关键词: 出现网,t切,转移集,t型s切

Abstract: This paper discussed the t-type s cuts and t cuts of occurrence nets.The concept of transfer sets were introduced and used to transfer one t cut to anather.The concept of t-type s cut was introduced,that there is correspondence between the set of t-type s cut and the set of t cuts was proved,that every t cut is the accompany set of a t-type s cut and that the transfer of a t cut correspond to the transfer of a t-type s cut with some transfer set were also proved.

Key words: Occurrence net,t cuts,Transfer set,t-type s cuts

[1] 吴哲辉.有界Petri网的进程表达式[J].中国科学(A辑),1995,25(12):1332-1340.
[2] 吴哲辉,王培良,赵茂先.无界公平Petri网的进程表达式[J].计算机学报,2000,23(4):337-344.
[3] 曾庆田,吴哲辉.Petri网的进程网系统[J].计算机学报,2002,25(12):1308-1315.
[4] 曾庆田,吴哲辉.无界Petri网的进程表达式[J].计算机学报,2003,26(12):1629-1636.
[5] 于枫,罗军舟,李伟,等.一种基于进程验证的Petri网可达性判定方法[J].计算机学报,2010,33(2):288-299.
[6] 汪明新,刘关俊,闫春钢.稳定有界Petri网的进程表达式[J].计算机科学,2011,38(2):55-58.
[7] 刘萍.出现网的抽象描述[J].甘肃高师学报,2014(5):76-78.
[8] 吴哲辉.Petri网导论[M].北京:机械工业出版社,2006.
[9] 曾庆田.一种基于同步合成构造Petri网进程表达式的方法[J].计算机学报,2008,31(3):381-394.
[10] 蒋昌俊.离散事件动态系统的PN机理论[M].北京:科学出版社,2000.
[11] 袁崇义.Petri网应用[M].北京:科学出版社,2013.
[12] 闫春钢,汪明新,刘关俊.有界网进程表达式与活性的关系[J].应用科学学报,2012,30(4):387-390.

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!