Petri网弱公平性和公平性关系的进一步研究  

Further Study of Relationship between Weak Fairness and Fairness of Petri Nets

作　　者：施洲琪 丁志军[1] 陈闳中[1] 

机构地区：[1]同济大学计算机科学与技术系,上海200092

出　　处：《计算机科学》2014年第7期49-51,共3页Computer Science

基　　金：国家自然科学基金(61173042);上海市"曙光计划"(10SG23);上海市青年科技启明星跟踪计划(12QH1402300);铁道部科技研究开发计划(2012X014-E)资助

摘　　要：在Petri网中,公平性概念的引入是为了讨论网系统中两个变迁发生之间的相互关系。这种关系可以很好地反映出模拟系统的各个事件在资源竞争中的有无饥饿性问题。文中基于弱公平性和公平性的定义与联系,证明了对于有界Petri网,满足弱公平性就满足公平性;同时证明了在两类无界Petri网中,可由弱公平性推导出公平性。并进一步证明其他类型的无界Petri网是不满足公平性的,即无法从弱公平性直接推导出公平性。In Petri net, the introduction of the concept fairness is to discuss the relationship of two transitions happened in net system. This relationship can well reflect whether each part of the concurrent system in the competition for re- source has starvation-free problem. According to the definition and the relation of the weak fairness and fairness, it was proved that fairness can be deduced by weak fairness for a bounded Petri net and for two classes unbounded Petri net. Fairness cannot be deduced by weak fairness for other unbounded Petri net.

关 键 词：PETRI网 弱公平性 公平性 有界性 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]