加权T－图的保性变换  

PROPERTY PRESERVE OPERATION FOR SIMPLIFYING WEIGHTED T-GRAPHS

作　　者：许安国[1] 吴哲辉[1] 

机构地区：[1]山东矿业学院应用数学与软件工程系

出　　处：《计算机学报》1997年第11期1038-1043,共6页Chinese Journal of Computers

基　　金：国家自然科学基金

摘　　要：Ｐｅｔｒｉ网的保性化简是Ｐｅｔｒｉ例分析的一种重要途径．Ｍａｒａｔａ等对活的和安全的标识Ｔ－图提出了系统的化简运算体系．蒋昌俊对加权Ｔ－图提出了若干种化简运算，这些化商运算能够保持网的结构有界性、守恒性、可重复性和相容性，但未涉及活性和公平性的保持问题．本文提出对加权Ｔ－图的另一类保性化简，这些化简运算可以保持网的结构活性和公平性．Petri net simplification of property preservation is a kind of methods for Petri net analysis. Murata et al. presented a series of net simplification operations for live and safe marked T-graphs. Jiang Changjun gave several simplification operations for weighted T-graphs under the preservations of structural boundedness,convervativeness, repetitiveness and consistency, but didn't concern to liveness and fairness, a more important property of Petri net. This paper presents another kind of net simplification operations for weighted T-graphs, which will preserve the structural liveness and fairness of nets.

关 键 词：加权T-图 结构活性 PETRI网 保性变换 

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