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
3 Pith papers cite this work, alongside 593 external citations. Polarity classification is still indexing.
3
Pith papers citing it
593
external citations · Crossref
representative citing papers
TABS+ automatically generates smart contract methods from BPMN models with support for nested multi-party transactions whose synchronization is handled by generated transaction mechanisms.
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.