A Simple Positive Flows Computation Algorithm for a Large Subclass of Colored Nets

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

• Type: Conference
• Year: 2007
• Where: FORTE
• Authors: Sami Evangelista, Christophe Pajault, Jean-François Pradat-Peyre
• Keywords: Formal Methods, FORTE 2007, Generative Family, Ordinary Petri Nets, Positive flows