关于使转换系统通过布尔网实现的技术复杂性
On the Complexity of Techniques That Make Transition Systems Implementable by Boolean Nets
AI总结：
本文研究了通过布尔网实现转换系统的技术复杂性，证明了在翻转触发器网类型下，相关问题为NP完全问题。
摘要：
合成是指决定给定标记转换系统（TS）A是否可以通过类型τ的网N实现。在决策为否定时，可能通过各种修改技术将A转换为可实现的TS B，如重标记边、删除边/状态/事件等。然而，限制此类修改的数量或优化技术可能更有助于保持原始问题。在本文中，我们证明了当τ对应于翻转触发器网或某些翻转触发器网衍生类型时，大多数相应问题都是NP完全的。
英文摘要：
Synthesis consists in deciding whether a given labeled transition system (TS) $A$ can be implemented by a net $N$ of type $τ$. 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 $τ$ corresponds to the type of flip-flop nets or some flip-flop net derivatives.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
