Syntactical Rules for Colored Petri Nets Manipulation
Résumé
Defining structural analysis techniques for colored Petri nets or generalizing existing techniques of ordinary nets to colored nets is made difficult by the management of the color mappings of the net. Indeed, the structure of the colored net does not necessarily reflect the one of the underlying net. A solution is to unfold the net and work directly on the unfolded net. Another one is to work directly on the colored net in a symbolic way. We explore in this work a symbolic framework based on constraints systems. A class of colored Petri nets is defined. We define simple rules to translate each color mapping allowed by this class into an equivalent constraints system. At last we work at a syntactical level to check properties of mappings. Two relevant examples of application are given.