The Complexity of Synthesizing nop-Equipped Boolean Nets from g-Bounded Inputs (Technical Report)
Computational Complexity
2019-11-15 v1 Logic in Computer Science
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.
Keywords
Cite
@article{arxiv.1911.05834,
title = {The Complexity of Synthesizing nop-Equipped Boolean Nets from g-Bounded Inputs (Technical Report)},
author = {Ronny Tredup},
journal= {arXiv preprint arXiv:1911.05834},
year = {2019}
}