On the Complexity of Techniques That Make Transition Systems Implementable by Boolean Nets

Raymond Devillers, Ronny Tredup

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…