The program structure tree: computing control regions in linear time
PLDI '94 Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation
From BPMN Process Models to BPEL Web Services
ICWS '06 Proceedings of the IEEE International Conference on Web Services
Faster and More Focused Control-Flow Analysis for Business Process Models Through SESE Decomposition
ICSOC '07 Proceedings of the 5th international conference on Service-Oriented Computing
Translating standard process models to BPEL
CAiSE'06 Proceedings of the 18th international conference on Advanced Information Systems Engineering
Applying data-flow analysis to models a novel approach for model analysis
SpringSim '10 Proceedings of the 2010 Spring Simulation Multiconference
Simplified computation and generalization of the refined process structure tree
WS-FM'10 Proceedings of the 7th international conference on Web services and formal methods
Adaptable Decentralized Service Oriented Architecture
Journal of Systems and Software
Hi-index | 0.00 |
BPMN is a notation for business process modeling. Process models can be complex, for instance, with unstructured (cyclic) topologies. BPEL, on the other hand, is the choice for web service orchestration. This paper presents an approach to systematically identifying and classifying subgraphs in a BPMN model that may be translated to BPEL code. Most of existing methods rely on exhaustive search. In contrast, we partition the BPMN model into single-entry single-exit regions which are then classified according to control flow information. This information is gathered by using a reachability analysis based on dataflow equations.