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.
In: Internation al Conference on Business Process Management
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
A reference model based on ISA-95 and Event Knowledge Graphs plus formalized patterns for automating enrichment of production event data from manufacturing sources, demonstrated on use cases.
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.
-
A Reference Model and Patterns for Production Event Data Enrichment
A reference model based on ISA-95 and Event Knowledge Graphs plus formalized patterns for automating enrichment of production event data from manufacturing sources, demonstrated on use cases.