Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1806.03703

Towards Completely Characterizing the Complexity of Boolean Nets Synthesis

Ronny Tredup·Christian Rosenke
View original source ↗Read source document ↗Export metadata ↓

Abstract

Boolean nets are Petri nets that permit at most one token per place. Research has approached this important subject in many ways which resulted in various different classes of boolean nets. But yet, they are only distinguished by the allowed interactions between places and transitions, that is, the possible effects of firing transitions. There are eight different interactions: no operation (nop), input (inp), output (out), set, reset (res), swap, test of occupation (used), and test of disposability (free). Considering every combination for a possible net class yields 256 boolean classes in total. The synthesis problem for a particular class is to take an automaton A and compute a boolean net of that class that has a state graph isomorphic to A. To the best of our knowledge, the computational complexity of this problem has been analyzed for just two of the 256 classes, namely elementary nets systems (nop, inp, out), where the problem is NP-hard, and flip-flop nets (nop, inp, out, swap), which are synthesizable in polynomial time. However, depending on the desired net features, like read-only places, exception handling, or hierarchy, one has to synthesize nets with other interactions as for instance contextual nets (nop, inp, out, used, free) or trace nets (nop, inp, out, set, res, used, free). The contribution of this paper is a thorough investigation of the synthesis complexity for the 128 boolean net classes that allow nop. Our main result is a general proof scheme that identifies 77 NP-hard cases. All remaining 51 classes are shown to be synthesizable in polynomial time where 35 of them turn out to be trivial.

Explore related subjects

cs.CC

Keep this discovery

BibTeXRIS

Ronny Tredup, Christian Rosenke. 2018-06-10. Towards Completely Characterizing the Complexity of Boolean Nets Synthesis. https://arxiv.org/abs/1806.03703

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

The Computational Complexity of Holant Problems on 4-regular Graphs from the Stable Subgroup Sequence of $SL(2,\mathbb{C})$

The Holant framework provides a general setting for studying counting problems and includes graph homomorphisms (\#GH) and counting constraint satisfaction problems (\#CSP) as special cases. Over the past twenty years, a series of computational complexity dichotomies have been established for Holant problems, but the classification for complex-valued signatures is still open. The main obstacle is the case in which all signatures have even arity. In this paper, we establish a dichotomy for Holant problems with a complex-valued 4-ary signature, which is a key base case for the full classification of Holant problems. We present a new strategy by introducing Schur's theorem, the classification of finite subgroups of $\mathrm{SL}(2,\mathbb{C})$ and stable subgroup sequences into the proof. These new techniques are of independent interest.

cs.CC↗
arXiv2026

Topology inside NC$^1$

We show that ACC$^0$ is precisely what can be computed with constant-width circuits of polynomial size and polylogarithmic genus. This extends a characterization given by Hansen, showing that planar constant-width circuits also characterize ACC$^0$. Thus polylogarithmic genus provides no additional computational power in this model. We consider other generalizations of planarity, including crossing number and thickness. We show that constant-width circuits of polynomial size and thickness two already suffice to capture all of NC$^1$.

cs.CC↗