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. To solve the resource-sharing problem, Jiao L, et al., investigate the transformation of merging a set of places of an asymmetric choice (AC) net satisfying siphon-trap-property (ST-property), and present the conditions for it to preserve liveness, boundedness and reversibility. The major motivation of this paper is to generalize the results of Jiao’s research and to extend the place-merging problem to subnet-sharing synthesis problem on AC nets or Petri nets beyond AC nets. The conditions of liveness preservation, boundedness preservation and reversibility preservation are presented. The conditions are also presented to show that the synthesis net of AC nets is an AC net. These results are useful for studying the static and dynamic properties of Petri synthesis nets, and for analyzing properties of large complex system.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
