首页 | 本学科首页   官方微博 | 高级检索  
     检索      

Petri网系统的弱公平性判定
引用本文:唐琳.Petri网系统的弱公平性判定[J].漳州师院学报,2010,24(3):27-31.
作者姓名:唐琳
作者单位:福建江夏学院,福建福州350001
基金项目:福建省社会科学规划项目 
摘    要:本文首先给出了一个Petri网系统的有效可重复向量的两个性质.随后,又给出了用有效可重复向量判断Petri网系统弱公平性相关问题的一个充分必要条件.在一个Petri网系统中,任意的两个变迁ti,tj,则tj弱公平依赖于ti,当且仅当不存在这样的有效可重复向量X,使得X(j)〉0且X(i)=0.最后,用一个实例展示结论的应用过程.

关 键 词:Petri网  弱公平性  可重复向量

Determination of the Weak Fairness in Petri Net Systems
YUE Hao.Determination of the Weak Fairness in Petri Net Systems[J].Journal of ZhangZhou Teachers College(Philosophy & Social Sciences),2010,24(3):27-31.
Authors:YUE Hao
Institution:YUE Hao(Department of Computer Science and Engineering,Zhangzhou Normal University,Zhangzhou,Fujian 363000,China)
Abstract:This paper firstly gives two properties of the effective repetitive vectors in a Petri net system.Second,the sufficient and necessary condition,which is for determining the problems concern weak fairness in a Petri net,is proposed.Suppose ti and tj are two arbitrary transitions in a Petri net system.The main conclusion is that tj weakly fair depends on ti,if and only if there does not exist such a effective repetitive vector that satisfies X(j)0 and X(i)=0.Finally,the applications of the conclusions are illustrated with an actual example.
Keywords:Petri net  weak fairness  repetitive vector
本文献已被 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号