In: Proceedings of the IEEE International Symposium on Circuits and Systems, 1989, Portland, OR, USA; Vol. 3, pages 1992-1995. New York, NY, USA: IEEE, 1989.
Abstract: Elementary P-invariants of marked graphs with edge weights, a fundamental subclass of Petri nets, are characterized in terms of flows in networks with positive gains. An algorithm for finding a P-basis is proposed.
Keywords: elementary flow; flow-basis; positive gain; P-invariant; marked graph; edge weight.