基于极小T-不变量增加的Petri网可达性分析

	基于极小T-不变量增加的Petri网可达性分析
	彭建兵 ; 焦莉
刊名	计算机应用研究
	2010
卷号	27 期号:10 页码:3798-3802
关键词	Petri网可达性极小T-不变量极小T-不变量关系图扩展极小T-不变量关系图借矩阵扩展借矩阵Petri net reachability minimal T-invariant relation graph of minimal T-invariants extended relation graph of minimal T-invariants borrowing matrix extended borrowing matrix
ISSN号	1001-3695
其他题名	reachability analysis of petri nets based on minimal t-invariant adding
中文摘要	基于极小T-不变量增加的Petri网的可达性分析,首先对网的状态方程加以合理的约束,求得一组特征解向量;然后利用扩展极小T-不变量关系图和扩展借矩阵在这些特征解向量的基础上适当添加整数倍的极小T-不变量;最后再判断这个添加极小T-不变量后的解向量的可达性。该方法不仅能判定一类含T-不变量Petri网的可达性,而且能在可达的情况下求得一个合法的变迁发生序列,并在一定程度上简化了可达性分析的过程。
学科主题	Computer Science
语种	中文
公开日期	2011-05-23
附注	The reachability problem of a class of Petri nets can be solved by a method based on minimal T-invariant adding. This approach first gave some reasonable constraint conditions to the fundamental equation of the net, and then obtained some characteristic vectors to solve the linear constrained problem. After that, added some properly minimal T-invariants to the characteristic vectors by using an extended relation graph of minimal T-invariants and an extended borrowing matrix. Finally it was determined whether or not the consequent vector can be transformed to a target state. This method can not only decide whether the target state is reachable, but also find a legal firing transition sequence leading to that state, and make the determination very simple
内容类型	期刊论文
源URL	[http://124.16.136.157/handle/311060/9906]
专题	软件研究所_计算机科学国家重点实验室 _期刊论文
推荐引用方式 GB/T 7714	彭建兵,焦莉. 基于极小T-不变量增加的Petri网可达性分析[J]. 计算机应用研究,2010,27(10):3798-3802.
APA	彭建兵,&焦莉.(2010).基于极小T-不变量增加的Petri网可达性分析.计算机应用研究,27(10),3798-3802.
MLA	彭建兵,et al."基于极小T-不变量增加的Petri网可达性分析".计算机应用研究 27.10(2010):3798-3802.