计算机应用与软件2013，Vol.30Issue(1)：40-42,82,4.DOI:10.3969/j.issn.1000-386x.2013.01.009
基于T-图的复杂Petri网约简算法研究
RESEARCH ON T-GRAPH BASED COMPLEX PETRI NETS REDUCTION ALGORITHM
摘要
Abstract
A parallel reduction approach for complex Petri net based on T-graph is proposed for resolving the problems of parallel control and simulation operation Petri net. Based on concurrency of Petri net, we present the T-graph based subnet partitioning principle of Petri net model, and propose the conditions of subnets partition together with its theoretical proof and examples of validation. According to that, we present the T-graph based subnets partitioning algorithm of Petri net, and perform the formalisation on corresponding concept of its subnets partitioning process; At last, we give an application example of bank deposit and withdrawal system, and carry out theoretical analysis on the subnets partitioning of its Petri net model and validation of algorithm programming, and the experimental results are in accordance with the theoretical analysis. Experimental results show that the method is an effective approach for partitioning, simplifying and analysing the Petri net with complex structure.关键词
Petri网/T-图/子网划分/划分条件/Petri网约简Key words
Petri net/T-Graph/Subnet partition/Partitioning conditions/Petri nets reduction分类
信息技术与安全科学引用本文复制引用
李书举,李文敬,罗锦坤,杨文..基于T-图的复杂Petri网约简算法研究[J].计算机应用与软件,2013,30(1):40-42,82,4.基金项目
国家自然科学基金项目(61163012) （61163012）
广西研究生教育创新计划项目(教育厅2011106030703M05). （教育厅2011106030703M05）
