A simple positive flows computation algorithm for a large subclass of colored nets
Résumé
Positive ?ows provide very useful informations that can be used to perform efficient analysis of a model. Although algorithms computing (a generative family of ) positive ?ows in ordinary Petri nets are well known, computing a generative family of positive ?ows in colored net remains an open problem.
We propose in this paper a pragmatic approach that allows us to de?ne an algorithm that computes a generative family of particular but useful positive ?ows in a large sub class of colored nets: the simple well-formed nets.