In: Proceedings of the 12th International Conference on Application and Theory of Petri Nets, 1991, Gjern, Denmark, pages 122-144. June 1991. Third author's new name: Pradat-Peyre.
Abstract: It is well known that a generative family of positive semi-flows provides a more accurate information than a generative family of ordinary ones. In this paper, the authors present a computation of positive flows for two families of coloured nets: unary regular nets and unary predicat/transition nets. The authors show that these two computations are based on the resolution of a parametrized equation. An algorithm is presented to solve this equation and the authors show how this algorithm can be used to compute the generative family of semi-flows in the unary regular nets and unary predicate/transition nets.
Keywords: computation (of) generative families (of) positive semi-flow(s) (in) coloured net(s); unary regular coloured net; unary predicat/transition coloured net.