中文摘要：

Petri网合成可以避免状态空间接指数阶迅速扩大的问题，并且在网扩大时可以保持原网的某些优良性质．为了解决资源共享问题，焦莉等人对于一个满足死锁．陷阱性质（ST-property）非对称选择网（asymmetric choice，简称AC）进行库所合并，给出了合并后的网保持原网活性、有界性和可回复性的条件．主要动机是对焦莉等人的研究结果进行推广，把对于AC网的库所合并问题推广到AC网或更一般的Petri网上的子网共享合成问题．给出了使共享PP．型子网合成Petri网系统保持活性，有界性和可回复性的条件以及多个AC网进行共享PP．型子网合成，使得到的合成网仍为AC网的条件．结果可为Petri网系统合成的静态和动态性质的考察提供有效途径，为Petri网复杂大系统的分析提供一定的手段．

英文摘要：

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.