Service Restructuring by Choreography-Driven Equivalence

Feng, Zaiwen; Peng, Rong; He, Ke; Zhang, He

doi:10.1109/scc.2012.62

Cited by 1 publication

(4 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this section, we review related studies on workflow antipatterns [37], [5], [6], [7], [8], [15], workflow transformation [38], [39], [20], [40], [20], [41], [21], workflow refactoring [17], [16], [9], workflow enhancement based on workflow mining [42], [11], [12], [23], and draw a comparison between these studies and our work.…”

Section: Related Workmentioning

confidence: 99%

“…For example, Ratkowski et al in [17] propose a BPEL transformation approach to enhance the non-functional properties (e.g., performance, modifiability, granularity, and maintainability) of the original BPEL workflow but do not change its behaviour. Feng et al leverage the data flow information to restructure service workflows [16]. Their goal is to improve the performance of service implementations while keeping the service protocol unchanged.…”

Section: Related Workmentioning

confidence: 99%

“…While most control flow and data flow errors lead to failures of the workflow [5], [7], [15], a workflow does not necessarily fail if it is not designed with maximized concurrency. However, such non-maximized concurrency does affect the quality of workflows [16]; for example, the makespan of a workflow could increase in such situations. In the worst case scenario, non-maximized concurrency between communicating activities could reduce the success probability of a workflow (service) collaboration [10].…”

Section: Introductionmentioning

confidence: 99%

“…Recently, a number of approaches to workflow refactoring have been proposed [17], [9], [10], [11], [16], [12]. For example, Wang et al first transform BPEL workflows into automata then employ Petri nets synthesis [18] to obtain a workflow with maximized concurrency [11].…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Workflow Refactoring for Maximizing Concurrency and Block-Structuredness

Song

Jacobsen

Cheung

et al. 2021

IEEE Trans. Serv. Comput.

View full text Add to dashboard Cite

In the era of Internet and big data, contemporary workflows become increasingly large in scale and complex in structure, introducing greater challenges for workflow modeling. Workflows are not with maximized concurrency and block-structuredness in terms of control flow, though languages supporting block-structuredness (e.g., BPEL) are employed. Existing workflow refactoring approaches mostly focus on maximizing concurrency according to dependences between activities, but do not consider the block-structuredness of the refactored workflow. It is easier to comprehend and analyze a workflow that is block-structured and to transform it into BPEL-like processes. In this paper, we aim at maximizing both concurrency and block-structuredness. Nevertheless, not all workflows can be refactored with a block-structured representation, and it is intractable to make sure that the refactored workflows are as block-structured as possible. We first define a well-formed dependence pattern of activities. The control flow among the activities in this pattern can be represented in block-structured forms with maximized concurrency. Then, we propose a greedy heuristics-based graph reduction approach to recursively find such patterns. In this way, the resulting workflow is with maximized concurrency and its block-structuredness approximates optimality. We show the effectiveness and efficiency of our approach with real-world scientific workflows.

show abstract