For the most recent entries see the Petri Nets Newsletter.

Structure of the Submarking-Reachability Problem and Network Programming.

Comeau, M.A.; Thulasiraman, K.

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.

Do you need a refined search? Try our search engine which allows complex field-based queries.

Back to the Petri Nets Bibliography