摘要
S-不变量是对Petri网进行结构性质分析的重要工具,但S-不变量的求取尚无有效算法。主要分析了S-不变量极小支集的判定问题。结合Petri网中库所子集列生成子阵的性质证明了一个库所子集为S-不变量极小支集的充分必要条件,在此基础上提出了判断给定库所子集是否为S-不变量极小支集的多项式算法。
The S-invariants play an important role in the structural property analysis of Petri nets even though there is no effective algorithm for the computation of S-invariants.This paper mainly discusses the decidability of minimal support of S-invariants.With a deep research of the property of derived matrix by place subset,a sufficient and necessary condition for a place subset to be a minimal support of S-invariants was proved firstly.And after that,a polynomial algorithm for the decidability of minimal suppor...
出处
《山东科技大学学报(自然科学版)》
CAS
2010年第1期100-104,共5页
Journal of Shandong University of Science and Technology(Natural Science)
基金
国家自然科学基金项目(60673053
60603090)
山东省优秀中青年科学家奖励基金项目(2006BS01019)
山东科技大学"春蕾计划"项目(2008BWZ027)