In: Proceedings of the 11th International Conference on Application and Theory of Petri Nets, 1990, Paris, France, pages 204-223. 1990.
Abstract: The paper solves the general problem of flow computation. The key result is a general algorithm which, when applied to the colour function matrix, decreases the number of non-zero functins in a given column. By iteration, the entire colour function matrix is annulled, giving a generative family of flows. The basis of the general algorithm is the use of the generalized semi-inverse. Another way of computing flows has been introduced for ordered nets. The problem has been solved over polynomial rings. In the paper, the author generalizes the basic theorem which allows to translate flow computation into solving the flow equation over a quotiented polynomial ring.
Keywords: coloured net; flow computation; ordered net; polynomial ring.
Back to the Petri Nets Bibliography