Proves that most bounded-modification problems for making transition systems implementable by flip-flop nets are NP-complete.
Transition Systems of Elementa ry Net Systems with Inhibitor Arcs
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2022 2verdicts
UNVERDICTED 2representative citing papers
Extends Petri nets with identifiers for object- and resource-aware systems and defines generalized correctness criteria with decidability analysis.
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.
-
Correctness Notions for Petri Nets with Identifiers
Extends Petri nets with identifiers for object- and resource-aware systems and defines generalized correctness criteria with decidability analysis.