Generating basis siphons and traps of Petri nets using the sign incidence matrix
Generating basis siphons and traps of Petri nets using the sign incidence matrix
复制标题
DOI：
10.1109/81.285680
复制
发表时间：
1994-04
期刊：
影响因子：
--
通讯作者：
Erwin R. Boer;T. Murata
中科院分区：
文献类型：
--
作者：
Erwin R. Boer;T. Murata
本文引入了一种新的矩阵--符号关联矩阵。利用这个符号关联矩阵，我们提出了一个简单的算法来生成所有的基本信标或陷阱，而不必首先生成所有的信标或陷阱。任何虹吸(圈闭)都可以表示为基础虹吸(基础圈闭)的并集。信标和陷阱的概念在Petri网分析中起着重要的作用。特别地，某些子类的Petri网的活性和可达性的标准可以用虹吸和陷阱来表示。>；
This paper introduces a new matrix called the sign incidence matrix for Petri nets. Using this sign incidence matrix, we present a simple algorithm for generating all basis siphons or traps without first generating all siphons or traps. Any siphon (trap) can be expressed as an union of basis siphons (basis traps). The concept of siphons and traps plays an important role in the analysis of Petri nets. In particular, criteria for liveness and reachability of some subclasses of Petri nets can be stated in terms of siphons and traps. >