Flip-Flop Nets

The so-called synthesis problem for nets which consists in deciding whether a given automaton is isomorphic to the case graph of a net and then constructing the net has been solved for various type of nets ranging from elementary nets to Petri nets. Though P/T nets admits polynomial time synthesis algorithms, the synthesis problem for elementary nets is known to be NP-complete. Applying the principle of generalized regions inherited from the P/T nets representation to the boolean setting gives rise to flip-flop nets. These nets are a slight generalization of elementary nets and admits a polynomial time synthesis