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.
Semantics and analysis of business process models in BPMN.Inf
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Systematic literature review synthesizing seven research streams on formal grammars in BPM and five corpus-grounded open challenges for cross-stream integration.
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.
-
Formal Grammars in Business Process Management: A Systematic Literature Review
Systematic literature review synthesizing seven research streams on formal grammars in BPM and five corpus-grounded open challenges for cross-stream integration.