Augmented reachability trees for 1-place-unbounded generalized Petri nets

IEEE Transactions on Systems, Man, and Cybernetics Part A:Systems and Humans.

Volumn 29, Issue 2, 1999, Pages 173-183

  Jeng, Mu Der ^a,b   Peng, Mao Yu ^c  

^a IEEE   (Taiwan)

^b NATIONAL TAIWAN OCEAN UNIVERSITY   (Taiwan)

^c ProMOS Technologies Inc   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; TREES (MATHEMATICS);

AUGMENTED REACHABILITY TREE (ART);

PETRI NETS;

EID: 0033101633     PISSN: 10834427     EISSN: None     Source Type: Journal    
DOI: 10.1109/3468.747852     Document Type: Article

References (7)

1. R. Karp and R. Miller, "Parallel program schemata," J. Comput. Syst. Sci., vol. 3, pp. 147-195, May 1969.
2. T. Murata, "Petri nets: Properties, analysis and applications," Proc. IEEE, vol. 77, pp. 541-580, Apr. 1989.
3. F. Y. Wang, "A modified reachability tree for petri nets," in Proc. IEEE Int. Conf. Syst., Man, Cybern., Charlottesville, VA, 1991, pp. 329-334.
4. J. L. Peterson, Petri Net Theory and the Modeling of Systems. Englewood Cliffs, NJ: Prentice-Hall, 1981.
5. E. W. Mayr, "An algorithm for the general Petri net reachability problem," SIAM J. Comput., vol. 13, pp. 441-460, Aug. 1984.
6. H. M. Salkin, Integer Programming. Reading, MA: Addison-Wesley, 1975.
7. R. Zurawski and M. C. Zhou, "Petri nets and industrial applications: A tutorial," IEEE Trans. Ind. Electron., vol. 41, pp. 567-583, Dec. 1994.