On the liveness problem of 1-place-unbounded Petri nets

Author

Jeng, Mu Der ; Peng, Mao Yu

Author_Institution

Dept. of Electr. Eng., Nat. Taiwan Ocean Univ., Keelung, Taiwan

Volume

4

fYear

1997

fDate

12-15 Oct 1997

Firstpage

3221

Abstract

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

Keywords

Petri nets; concurrency control; tree data structures; trees (mathematics); 1-place-unbounded Petri nets; ART; augmented reachability tree; classical reachability tree; deadlock free; graphs; liveness problem; minimal token number; negative costs; shortest path problem; unbounded place; Concurrent computing; Costs; Mathematical model; Oceans; Petri nets; Power system modeling; Resource management; Shortest path problem; Subspace constraints; System recovery;

fLanguage

English

Publisher

ieee

Conference_Titel

Systems, Man, and Cybernetics, 1997. Computational Cybernetics and Simulation., 1997 IEEE International Conference on

Conference_Location

Orlando, FL

ISSN

1062-922X

Print_ISBN

0-7803-4053-1

Type

conf

DOI

10.1109/ICSMC.1997.633101

Filename

633101