BPEL and Patterns
BPEL fares exceptionally well in its support for support for P4 patterns. As rated by P4 members in its paper,[5] BPEL directly supports 13 of the 20 patterns, and it indirectly supports another one. The results of the paper are captured in Table 5-5.
Pattern | Compliance (+, +-, -) | Approach | Notes |
Sequence | + | | |
Parallel Split | + | | |
Synchronization | + | | |
Exclusive Choice | + | | |
Simple Merge | + | | |
Multi-Choice | + | | See P4 paper, p.8f. |
Sync Merge | + | Use dead path elimination to join the results of the multiple choice. | |
Multi Merge | - | No. | |
Discriminator | - | No. | See P4 paper, p.9. |
Arbitrary cycles | - | Only structured loops are allowed. No goto-like constructs. | |
Implicit Termination | + | | |
Multiple Instances (MI) Without Synchronization | + | | |
MI With Design Time Knowledge | + | Run each instance as a separate
activity in a | |
MI With Runtime Knowledge | - | Onerous. | See P4 paper, p. 11. |
MI Without Runtime Knowledge | - | ||
Deferred Choice | + | | |
Interleaved Parallel Routing | +- | Multiple |
Get Essential Business Process Modeling now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.