一类Petri网系统建模与可达性分析的STP方法  

STP-Based Approach to Modeling and Reachability Analysis of a Class of Petri Net Systems

作　　者：韩晓光[1,2] 陈增强[1,2,3] 张奎泽 刘忠信[1,2] 张青[3] HAN Xiao-guang CHEN Zeng-qiang ZHANG Kui-ze LIU Zhong-xin ZHANG Qing(College of Computer and Control Engineering, Nankai University, Tianjin 300350, China Tianjin Key Laboratory of Intelligent Robotics, Nankai University, Tianjin 300350, China College of Science, Civil Aviation University of China, Tianjin 300300, China College of Automation, Harbin Engineering University, Harbin 150001, China)

机构地区：[1]南开大学计算机与控制工程学院,天津300350 [2]天津市智能机器人技术重点实验室,天津300350 [3]中国民航大学理学院,天津300300 [4]哈尔滨工程大学自动化学院,哈尔滨150001

出　　处：《北京邮电大学学报》2016年第6期72-76,共5页Journal of Beijing University of Posts and Telecommunications

基　　金：国家自然科学基金项目(61573199;61573200);天津自然科学基金资助项目(14JCYBJC18700;13JCYBJC17400)

摘　　要：基于矩阵半张量积(STP)方法研究了一类Petri网系统(PNSs)的建模和可达性问题.首先,利用STP将这类PNSs的动态演化表示为离散时间双线性方程;然后,给出了这类PNSs的变迁-状态邻接矩阵的定义,利用所建立的双线性方程和变迁-状态邻接矩阵给出了这类PNSs状态可达性判别的几个充要条件,同时设计了计算这类PNSs任意两可达状态的所有路径的有效算法;最后,用实例说明了所得结果的可行性与有效性.Modeling and reachability of a class of Petri net systems（ PNSs） by using the semi-tensor product of matrices（ STP） was investigated. First,the dynamics of PNSs,by resorting to STP,are converted into a discrete-time bilinear equation. Second,the transition-state adjacency matrix of the PNSs is defined,several necessary and sufficient conditions are obtained for the reachability of the PNSs by means of this bilinear equation and transition-state adjacency matrix. A new algorithm is also designed to find all of the firing sequences of any two reachable states. Finally,an example is presented to illustrate the theoretical results.

关 键 词：PETRI网系统 可达性 矩阵的半张量积 变迁-状态转移矩阵 变迁-状态邻接矩阵 

分 类 号：TP273[自动化与计算机技术—检测技术与自动化装置]