A recursive algorithm transforms workflow nets into POWL 2.0 models with formal proofs of language preservation and completeness for separable nets, succeeding on 1,493 benchmark models.
Edge, Event and State Removal: The Complexity of Some Basic Techniques that Make Transi- tion Systems Petri Net Implementable
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
Proves that most bounded-modification problems for making transition systems implementable by flip-flop nets are NP-complete.
citing papers explorer
-
Hierarchical Decomposition of Separable Workflow-Nets
A recursive algorithm transforms workflow nets into POWL 2.0 models with formal proofs of language preservation and completeness for separable nets, succeeding on 1,493 benchmark models.
-
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.