On the liveness problem of 1-place-unbounded Petri nets
On the liveness problem of 1-place-unbounded Petri nets
复制标题
DOI：
10.1109/icsmc.1997.633101
复制
发表时间：
1997-10
期刊：
影响因子：
--
通讯作者：
M. Jeng;Mao Yu Peng
中科院分区：
文献类型：
--
作者：
M. Jeng;Mao Yu Peng
提出了一种增强可达树（ART）来扩展经典可达树的能力，用于解决一类最多存在一个无界点的 Petri 网的活跃性问题。这个想法是基于无界地方的最小令牌数的计算。显示了获取最小令牌数量的算法。给出了示例来说明该技术。该方法还可用于解决具有负成本的图中的最短路径问题。
An augmented reachability tree (ART) is proposed to extend the ability of the classical reachability tree for solving the liveness problem of a class of Petri nets where there exists at most one unbounded place. The idea is based on the computation of the minimal token number of the unbounded place. An algorithm for obtaining the minimal token number is shown. Examples are given to illustrate the technique. The proposed method can also be used to solve the shortest path problem in graphs with negative costs.