2004
DOI: 10.1007/978-3-540-30468-5_10
|View full text |Cite
|
Sign up to set email alerts
|

Untangling Unstructured Cyclic Flows – A Solution Based on Continuations

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
24
0

Year Published

2004
2004
2012
2012

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 32 publications
(25 citation statements)
references
References 7 publications
0
24
0
Order By: Relevance
“…Different transformation strategies were also illustrated in [18] and an alternative classification of (unstructured) process models was proposed in [9]. A method specifically tailored to untangling unstructured cyclic models and transforming them into structured BPEL models is presented in [10,12]. Finally, Polyvyanyy et al [25] provide a complete characterization of unstructured acyclic process models that are inherently unstructured, based on the RPST decomposition developed by Vanhatalo et al [33].…”
Section: Structuring Process Modelsmentioning
confidence: 99%
“…Different transformation strategies were also illustrated in [18] and an alternative classification of (unstructured) process models was proposed in [9]. A method specifically tailored to untangling unstructured cyclic models and transforming them into structured BPEL models is presented in [10,12]. Finally, Polyvyanyy et al [25] provide a complete characterization of unstructured acyclic process models that are inherently unstructured, based on the RPST decomposition developed by Vanhatalo et al [33].…”
Section: Structuring Process Modelsmentioning
confidence: 99%
“…This implies that users have to think in terms of BPEL constructs (e.g., blocks, syntactical restrictions on links, etc.). More related is the work of Steven White that discusses the mapping of BPMN onto BPEL [43] and the work by Jana Koehler and Rainer Hauser on removing loops in the context of BPEL [25]. Note that none of these publications provides a mapping of some (graphical) process modeling language onto BPEL: [43] merely presents the problem and discusses some issues using examples and [25] focusses on only one piece of the puzzle.…”
Section: Related Workmentioning
confidence: 99%
“…More related is the work of Steven White that discusses the mapping of BPMN onto BPEL [43] and the work by Jana Koehler and Rainer Hauser on removing loops in the context of BPEL [25]. Note that none of these publications provides a mapping of some (graphical) process modeling language onto BPEL: [43] merely presents the problem and discusses some issues using examples and [25] focusses on only one piece of the puzzle. Also related is the mapping presented in [34] where a subclass of BPMN is mapped onto BPEL using ECA rules as an intermediate format.…”
Section: Related Workmentioning
confidence: 99%
“…In a pick-pattern (Figure 2(d)), an event-based XOR decision gateway must be followed by receive tasks or intermediate message or timer events. 9 Note that out(ic) ⊆ T R ∪ E I is the set of receive tasks and intermediate events following the event-based XOR decision gateway ic. Between the merge gateway oc and each of the objects in out(ic) there is at most one task or event object.…”
Section: Well-structured Pattern-based Translationmentioning
confidence: 99%
“…However, these techniques are no longer applicable when AND-splits and AND-joins are introduced. An identification of situations where unstructured process diagrams cannot be translated into equivalent structured ones (under weak bisimulation equivalence) can be found in [7,11], while an approach to overcome some of these limitations for processes without parallelism is sketched in [9]. However, these related work only address a piece of the puzzle of translating from graph-oriented process modelling languages to BPEL.…”
Section: Related Workmentioning
confidence: 99%