In: Transactions of the Institute of Electronics, Information and Communication Engineers E, Vol. E72, No. 12, pages 1400-1409. December 1989.
Abstract: Computational complexity aspects of the legal firing sequence problem and the following related net problems are discussed: (a) the generalized submarking reachability problem, (b) the submarking reachability problem, (c) the marking reachability problem, (d) the generalized submarking reachability problem on a minimum initial submarking, (e) the lower and upper bounded submarking problem, (f) the optimum firing sequence problem, (g) the minimum initial marking problem.
Keywords: time complexity; firing sequence, legal; marking reachability; optimum firing sequence; minimum initial marking.