Synthesis consists in deciding whether a given labeled transition system (TS) $A$ can be implemented by a net $N$ of type $\tau$. In case of a negative decision, it may be possible to convert $A$ into an implementable TS $B$ by applying various modification techniques, like relabeling edges that previously had the same label, suppressing edges/states/events, etc. It may however be useful to limit the number of such modifications to stay close to the original problem, or optimize the technique. In this paper, we show that most of the corresponding problems are NP-complete if $\tau$ corresponds to the type of flip-flop nets or some flip-flop net derivatives.

翻译：综合（Synthesis）在于判断一个给定的带标号变迁系统（TS）$A$ 是否可以被一个类型为 $\tau$ 的网 $N$ 实现。在否定决策的情况下，可能通过应用各种修改技术（例如对先前具有相同标号的边进行重新标号、删除边/状态/事件等）将 $A$ 转换为一个可实现的 TS $B$。然而，限制此类修改的数量以保持接近原问题，或优化该技术，可能是有用的。本文表明，若 $\tau$ 对应于触发器网或某些触发器网衍生类型，则大多数相应问题都是 NP-完全的。