欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
提出一种基于二分法搜索原理计算基本信标的高效算法.如果网的特征T-向量矩阵非行满秩,则将其按行一分为二.以同样的方法处理新得到的子矩阵,直至得到的子矩阵行满秩,则该矩阵对应的信标全为基本信标.以这些基本信标为基础,递归搜索其余子矩阵,最终得到全部基本信标.该算法与顺序搜索法相比较,矩阵求秩的次数大为减少.对Petri的一个子类——一个拥有资源的简单加工进程的线性系统（LS3PR）网系统来说,该算法是一个多项式算法,并通过一系列算例验证了该算法的效率.
英文摘要：
Elementary siphons are computationally expensive when the size of a Petri net is large. Based on binary search, this paper proposes an efficient algorithm for finding a set of elementary siphons. If the characteristic T-vector matrix of a net is not of row full rank, the matrix is divided into two sub- matrices. This step is repeated until a row full rank sub-matrix is found. The siphons corresponding to the sub-matrix are elementary. Based on these elementary siphons, other elementary siphons can be accordingly found by recursive search in the sub-matrices. This algorithm ensures that the number of times of calculating the ranks of matrices is greatly reduced compared with the traditional sequential search method. For the linear simple sequential process with resources （LS^3PR）, it is polynomial. Finally, the efficiency is demonstrated by case study.
同期刊论文项目
同项目期刊论文
A survey and comparison of Petri net-based deadlock prevention policies for flexible manufacturing s
Synthesis of structurally simple supervisors enforcing generalized mutual exclusion constraints in p
Low-cost and high-performance supervision in ratio-enforced automated manufacturing systems using ti
Efficient computation of strict minimal siphons for a class of Petri nets models of automated manufa
On the minimal siphons and deadlock prevention in the Petri net model of the dining philosopher’s pr
Comments on "An iterative synthesis approach to Petri net based deadlock prevention policy for flexi
Clarification on the computation of liveness-enforcing supervisor for resource allocation systems wi
期刊信息
位置：