  Boolean Petri nets equipped with nop allow places and transitions to be
independent by being related by nop. We characterize for any fixed natural
number g the computational complexity of synthesizing nop-equipped Boolean
Petri nets from labeled directed graphs whose states have at most g incoming
and at most g outgoing arcs.
