Paper Info
Title
Compiling business processes: untangling unstructured loops in irreducible flow graphs
Abstract
This paper presents a systematic study of some major problems involved in the transformation of business process modelling languages to executable business process representations. A business process modelling language usually uses the simple concept of 'goto' to describe the operation sequence of a business. If a structured language is chosen as the executable representation, it is difficult to compile the unstructured goto flows into structured statements when the process model is irreducible. This paper discusses a method called Regular Expression Language (REL). REL is a method that can compile a business process model that is irreducible with unstructured loops to statements in structured languages with controlled code complexity. Examples are given for compiling models expressed as UML2 Activity Diagrams into the Business Process Execution Language for Web Services (BPEL4WS).
Year
DOI
Venue
2006
10.1504/IJWGS.2006.008880
IJWGS
Keywords
Field
DocType
process model,business process,unstructured loop,structured language,unstructured goto flow,business process model,executable representation,irreducible flow graph,regular expression language,business process representation,business process execution language,compiling business process,structured statement,web service,regular expression,activity diagram,business process modelling
Artifact-centric business process model,Programming language,Business process,Computer science,Theoretical computer science,Business Process Execution Language,Business domain,Business process modeling,Business Process Model and Notation,Business rule,Distributed computing,Goto
Journal
Volume
Issue
Citations 
2
1
21
PageRank 
References 
Authors
1.16
10
5
Name
Order
Citations
PageRank
Wei Zhao13532404.01
Rainer Hauser218517.35
Kamal Bhattacharya340327.53
Barrett R. Bryant448555.57
Fei Cao5697.49