无冲突可重复网极小活标识的配置  

The Assignment of Minimal Live Markingfor Choice-Free Repetitive Petri Net

作　　者：许安国[1] 赵义军[1] 

机构地区：[1]山东科技大学基础部,泰安271019

出　　处：《系统仿真学报》2003年第z1期35-39,共5页Journal of System Simulation

基　　金：国家自然科学基金(60173053);山东省自然科学基金项目(Y2002G09)。

摘　　要：首先给出无冲突可重复网的定义,并证明无冲突可重复网是结构活的。然后将无冲突可重复网的极小活标识的配置化为强连通-T图极小活标识的配置。文[2]虽然给出-T图极小活标识的判断方法,但是对于一个比较复杂的-T图的极小活标识的配置是无法实现的。本文通过求解强连通-T图的1+-nm个线性无关的极小-S不变量的支集,找出1+-nm个线性无关的有向回路组,然后给出构造强连通-T图以任一变迁为根的有向生成树,最后给出配置强连通-T图极小活标识的有效算法。The first, the choice-free repetitive Petri net is defined, and it is proven that this kind of nets is all structural live. The second, the assignment of minimal live marking for choice-free repetitive Petri net is transformed into the assignment of minimal live marking for the strong connective T graph. The m-n+1 linear independence the group of direct circles is obtained by solving m-n+1 linear independence minimal S invariants?support sets of the strong connective T graph. Hence, the direct spanning root-tree of the strong connective T graph is constructed. The effective algorithm of the assignment of minimal live marking is given based on the direct spanning root-tree.

关 键 词：无冲突可重复Petri网 活性 极小活标识 T_图 

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