Top-Down Hierarchical Decomposition of Separable Workflow Nets into POWL 2.0:
- Algorithm 1
PartitionMG[PETRI25, p. 17] (Marked Graph Poset Decomposition) - Algorithm 2
PartitionSM[PETRI25, p. 19] (State Machine Choice Graph Decomposition) - Algorithm 3
WFNetToPOWL[PETRI25, p. 21] (Recursive SESE Decomposition) - Theorem 5.6 Completeness Guarantee [PETRI25, p. 24]
Summary
Functions
Algorithm 3 WFNetToPOWL(N) [PETRI25, p. 21]:
Recursively decomposes a separable Workflow Net into a canonical POWL 2.0 AST.
Algorithm 1 PartitionMG: Decomposes Marked Graph into a Partial Order.
Algorithm 2 PartitionSM: Decomposes State Machine into a Choice Graph.
Functions
@spec convert(Ex4pmEngine.WorkflowNet.t()) :: {:ok, Ex4pmEngine.POWL.Node.t()} | {:error, atom()}
Algorithm 3 WFNetToPOWL(N) [PETRI25, p. 21]:
Recursively decomposes a separable Workflow Net into a canonical POWL 2.0 AST.
Algorithm 1 PartitionMG: Decomposes Marked Graph into a Partial Order.
Algorithm 2 PartitionSM: Decomposes State Machine into a Choice Graph.