Comments on "A modified reachability tree approach to analysis of unbounded Petri nets"

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Volumn 36, Issue 5, 2006, Pages 1210-

  Ru, Yu ^a   Wu, Weimin ^b   Hadjicostis, Christoforos N ^a  

^a University of Illinois at Urbana Champaign   (United States)

^b STATE KEY LABORATORY OF INDUSTRIAL CONTROL TECHNOLOGY   (China)

Author keywords

Petri nets; Reachability tree

Indexed keywords

ALGORITHM; ARTIFICIAL INTELLIGENCE; ARTIFICIAL NEURAL NETWORK; COMPUTER SIMULATION; MATHEMATICAL COMPUTING; NOTE; THEORETICAL MODEL;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; COMPUTER SIMULATION; MODELS, THEORETICAL; NEURAL NETWORKS (COMPUTER); NUMERICAL ANALYSIS, COMPUTER-ASSISTED;

EID: 33749393592     PISSN: 10834419     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCSI.2006.876811     Document Type: Note

References (2)

1. F.-Y. Wang, Y. Q. Gao, and M. C. Zhou, "A modified reachability tree approach to analysis of unbounded Petri nets," IEEE Trans. Syst., Man, Cybern. B, Cybern., vol. 34, no. 1, pp. 303-308, Feb. 2004.
2. R. Karp and R. Miller, "Parallel program schemata," J. Comput. Syst. Sci., vol. 3, no. 2, pp. 147-195, May 1969.