Knitting technique with TP-PT generations for Petri net synthesis

Abstract

The behavior of a Petri net (PN) depends not only on the graphical structure, but also on the initial marking of the net. The knitting technique solves the structural problem. It contains some simple yet effective rules which can guide the synthesis of PN with desired properties. The previous knitting technique admits only TT generations among sequential or concurrent processes and PP generations among sequential or exclusive processes. The synthesized nets, however, are restricted because some generations are prohibited. Recently, we have improved the synthesis rules such that the previously forbidden generations are admissible if they are accompanied with additional generations. This paper deals with how to remove the restrictions of TP-path or PT-path generations.

Checking marking reachability with the state equation in Petri net subclasses

“…Concerning refinement, synthesis, composition (node merging, fusion...) and abstraction techniques, the previous works closest to our notion introduced for PCMG ≤ are [39,40,31,28,41,42,43,44]. Numerous other studies provide algorithms for synthetizing, from a given labeled transition system, a Petri net with isomorphic reachability graph, see e.g.…”