Proves that most bounded-modification problems for making transition systems implementable by flip-flop nets are NP-complete.
Springer, Germany (2011)
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
eFLINT is a normative specification language combining declarative and procedural elements to support automated compliance reasoning before, during, and after software execution.
citing papers explorer
-
On the Complexity of Techniques That Make Transition Systems Implementable by Boolean Nets
Proves that most bounded-modification problems for making transition systems implementable by flip-flop nets are NP-complete.
-
Reflections on the design, applications and implementations of the normative specification language eFLINT
eFLINT is a normative specification language combining declarative and procedural elements to support automated compliance reasoning before, during, and after software execution.