In: Transactions of the Institute of Electronics, Information and Communication Engineers E, Vol. E72, No. 12, pages 1390-1399. December 1989.
Abstract: The authors discuss computational complexity and approximation algorithms for the minimum initial marking problem of a Petri net PN: Given PN and a firing vector X, find a minimum initial marking M such that there is a firing sequence which is legal on M with respect to X.
Keywords: computational complexity (of the) minimum initial marking problem.