关于单纯Petri网的全进程  

On the Whole Process of Pure Petri Net

作　　者：刘萍 LIU Ping(Department of Computer Science,Gansu Normal University for Nationalities,Hezuo Gansu 747000)

机构地区：[1]甘肃民族师范学院计算机科学系,甘肃合作747000

出　　处：《甘肃高师学报》2020年第5期8-10,共3页Journal of Gansu Normal Colleges

基　　金：甘肃民族师范学院院长基金资助项目“有界Petri网完全进程的研究”(GSNU-YZKY-1902).

摘　　要：引入了单纯Petri网的概念,设∑=(S,T;F,M0)是可逆有界Petri网,已证明可逆有界Petri网可由几个单纯Petri网连接得到.因此,为了讨论可逆有界Petri网的全进程就有必要研究单纯Petri网的结构和全进程,并证明单纯Petri网的结构由其可达标识链决定,为进一步认知单纯Petri网的全进程提供新思路.In this paper,the concept of pure Petri net was introduced,the structure of simple Petri-(Let be a reversible bounded Petri Net-∑=(S,T;F,M0))net was discussed.We proved that∑can be obtained by connecting several simple Petri nets.Therefore,in order to discuss the whole process of reversible bounded Petri net,it is necessary to study the structure and whole process of pure Petri net.In this paper,it is proved that the structure of a pure Petri net can be determined by its reachability identification chain,which provides new ideas for further understanding the whole process of pure Petri net.

关 键 词：可逆有界Petri网 单纯Petri网 全进程 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]