基于T-图的复杂Petri网约简算法研究  

RESEARCH ON T-GRAPH BASED COMPLEX PETRI NETS REDUCTION ALGORITHM

作　　者：李书举[1] 李文敬[1] 罗锦坤[1] 杨文[1] 

机构地区：[1]广西师范学院计算机与信息工程学院,广西南宁530001

出　　处：《计算机应用与软件》2013年第1期40-42,82,共4页Computer Applications and Software

基　　金：国家自然科学基金项目(61163012);广西研究生教育创新计划项目(教育厅2011106030703M05)

摘　　要：为了解决Petri网并行控制和模拟运行的问题,提出基于T-图的复杂Petri网并行约简方法。根据Petri网的并发性,给出基于T-图的Petri网模型的子网划分原理,提出子网划分的条件,并给出理论证明和实例验证;在此基础上,提出基于T-图的Petri网的子网划分算法,并对其子网划分过程相关概念进行形式化;最后,给出一个银行存取款系统的应用示例,对其Petri网模型的子网划分进行理论分析和算法的编程验证,实验结果与理论分析相一致。实验结果表明,该算法是对复杂结构Petri网进行划分、化简、分析的一种有效方法。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网约简 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]