In: Lecture Notes in Computer Science : Theory and Applications of Models of Computation, 2006, pages 576-587. 2006. URL: http://dx.doi.org/10.1007/1175032155.
Abstract: Petri net synthesis can avoid the state exploration problem, which is of exponential complexity, by guaranteeing the correctness in the Petri net while incrementally expanding the net. The conventional Petri net synthesis approaches, in general, suffer the drawback of only being able to synthesize a few classes of nets, such as state machines, marked graphs or asymmetric choice(AC) nets. However, the synthesis technique of Petri nets shared PP-type subnets can synthesize Petri nets beyond AC nets. One major advantage of the synthesis technique is that the resultant Petri net is guaranteed to be live, bounded and reversible. Most current synthesis techniques cannot handle systems with shared subsystems. To solve resource-sharing problem, Jiao L. presented the conditions for an AC net satisfying siphon-trap-property (ST-property) to be live, bounded and reversible. The major motivation of this work is to generalize the results in  and to extend the resource-sharing technique to subsystem-sharing technique on AC nets or Petri nets beyond AC nets.
Keywords: Petri nets; analysis; synthesis; liveness; boundedness.
Back to the Petri Nets Bibliography