2000 character limit reached
The Complexity of Synthesizing nop-Equipped Boolean Nets from g-Bounded Inputs (Technical Report) (1911.05834v1)
Published 1 Nov 2019 in cs.CC and cs.LO
Abstract: 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.