Petri net synthesis and synchronization using knitting technique

The conventional Petri net (PN) synthesis approaches, in general, suffer the drawback of synthesizing limited classes of nets. However, the knitting technique can synthesize PNs beyond asymmetric-choice nets. In addition, one major advantage of the knitting technique is that the resultant PN is guaranteed to be live, bounded, and reversible-the well-behaved properties. Most current synthesis techniques cannot handle system with shared resources, Zhou and DiCesare (1991) presented the conditions of a PN containing sequential mutual exclusion (SME) to be live, bounded, and deadlock-free. The major motivation of this work is to generalize Zhou and DiCesare´s work and to extend the authors´ knitting technique (1994) to construct classes of PNs that involve synchronization and shared resources according to the synthesis rules. In addition, this paper begins the consideration of marking in the PN synthesis with knitting technique