In: IEEE Transactions on Circuits and Systems, Vol. 35, No. 1, pages 89-100. January 1988.
Abstract: Using a linear programming formulation, a unified treatment of the submarking-reachability problem for both capacitated and uncapacitated marked graphs is presented. In both cases, the problem reduces to that of testing feasibility of the dual transshipment problem of operations research.
Back to the Petri Nets Bibliography