The linear time-branching time spectrum (extended abstract)
CONCUR '90 Proceedings on Theories of concurrency : unification and extension: unification and extension
Free choice Petri nets
Distributed and Parallel Databases
An Alternative Way to Analyze Workflow Graphs
CAiSE '02 Proceedings of the 14th International Conference on Advanced Information Systems Engineering
Getting rid of OR-joins and multiple start events in business process models
Enterprise Information Systems - Challenges and Solutions in Enterprise Computing - 11th International IEEE EDOC Conference (EDOC 2007)
Automatic Workflow Graph Refactoring and Completion
ICSOC '08 Proceedings of the 6th International Conference on Service-Oriented Computing
Symbolic execution of acyclic workflow graphs
BPM'10 Proceedings of the 8th international conference on Business process management
A new semantics for the inclusive converging gateway in safe processes
BPM'10 Proceedings of the 8th international conference on Business process management
Analysis on demand: Instantaneous soundness checking of industrial business process models
Data & Knowledge Engineering
| Hi-index | 0.00 |
Some popular modeling languages for business processes, e.g., BPMN, contain inclusive OR-joins (IOR-joins), but others, e.g., Petri nets, do not. Various scenarios in Business Process Management require, or benefit from, translating a process model from one language to another. This paper studies whether the control flow of a process containing IOR-joins can be translated into a control flow without IOR-joins. First we characterize which IOR-joins can be replaced locally and define a local replacement for each replaceable IOR-join. Then, we present examples that cannot be locally replaced but have a more general translation. We give a non-local replacement technique, together with its condition of applicability, which runs in polynomial time. Finally, we show that there exist simple process models with an IOR-join that cannot be replaced --- in the sense that its synchronization behavior cannot be obtained by any combination of AND and XOR gateways. The proof reveals an intrinsic limitation on the replaceability of IOR-joins and hence the translatability of BPMN-like control flow into Petri nets.