When a Petri net is synthesised from a labelled transition system, it is frequently desirable that certain additional constraints are fulfilled. For example, in circuit design, one is often interested in constructing safe Petri nets. Targeting such subclasses of Petri nets is not necessarily computationally more efficient than targeting the whole class. For example, targeting safe nets is known to be NP-complete while targeting the full class of place/transition nets is polynomial, in the size of the transition system. In this paper, several classes of Petri nets are examined, and their suitability for being targeted through efficient synthesis from labelled transition systems is studied and assessed. The focus is on choice-free Petri nets and some of their subclasses. It is described how they can be synthesised efficiently from persistent transition systems, summarising and streamlining in tutorial style some of the authors’ and their groups’ work over the past few years.

中文翻译：

---

面向目标的Petri网综合

当从标记的过渡系统合成陪替氏网时，通常期望满足某些附加约束。例如，在电路设计中，人们经常对构造安全的Petri网感兴趣。针对Petri网的此类子类不一定比针对整个类具有更高的计算效率。例如，在过渡系统的大小上，以安全网为目标是已知的NP完全，而以位置/过渡网的全部类别为目标是多项式。在本文中，研究了几类Petri网，并研究和评估了它们对于通过标记过渡系统进行有效合成作为目标的适用性。重点放在无选择的Petri网及其某些子类上。