Analyzing Interacting BPEL Processes

Lohmann, Niels; Massuthe, Peter; Stahl, Christian; Weinberg, Daniela

doi:10.1007/11841760_3

Cited by 85 publications

(53 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the logic-based method [20] process descriptions are written in a temporal logic language like Promela and then properties of the composite process are verified using a tool such as SPIN [14]. [16] gives an approach for building a controller for an open workflow net, as a graph with Boolean conditions for the nodes to determine feasible directions of progress. The Petri-nets approach [21] describes processes as Petri-nets and then applies Petri-net verification tools (such as Woflan [28]) to check properties like reachability, livelocks and deadlocks.…”

Section: Discussion and Related Workmentioning

confidence: 99%

Algorithms Based on Pattern Analysis for Verification and Adapter Creation for Business Process Composition

Kumar

Shan

2008

On the Move to Meaningful Internet Systems: OTM 2008

View full text Add to dashboard Cite

Abstract. With more automation in inter-organizational supply chains and proliferation of Web services technology, the need for organizations to link their business services and processes is becoming increasingly important. Ideally, such linking must be automated and also possible to do on-the-fly in an ad hoc manner. In this paper, we view business processes in terms of standard patterns, and describe a pattern compatibility matrix and rules that allow us to simplify the task of checking compatibility between two or more processes because these prerequisite rules can be applied to each pattern separately, thus reducing the search space. We give an algorithm for applying these rules to check process compatibility. If two processes are compatible, we determine whether an adapter is required, and if so, a minimal adapter is generated by another algorithm. Two variants of the algorithm (PBA and PBA-MIN) are implemented, and experimental results and comparisons with an existing algorithm are given.

show abstract

Section: Discussion and Related Workmentioning

confidence: 99%

Algorithms Based on Pattern Analysis for Verification and Adapter Creation for Business Process Composition

Kumar

Shan

2008

On the Move to Meaningful Internet Systems: OTM 2008

View full text Add to dashboard Cite

show abstract

“…BPEL2oWFN maps BPEL specifications onto open Workflow nets using an algorithm described in [6]. The resulting nets can be loaded into a tool called Fiona that can check for various properties both for standalone and for inter-connected processes [12]. Driven by the same motivation of enabling static analysis of BPEL processes, Brogi and Popescu [3] present a translation from BPEL to YAWL (a graph-oriented process definition language inspired by Petri nets).…”

Section: Related Workmentioning

confidence: 99%

Pattern-Based Translation of BPMN Process Models to BPEL Web Services

Ouyang

Dumas

Hofstede

et al.

Advances in Web Services Research

View full text Add to dashboard Cite

Abstract. The Business Process Modelling Notation (BPMN) is a graph-oriented language in which control and action nodes can be connected almost arbitrarily. It is primarily targeted at domain analysts and is supported by many modelling tools, but in its current form, it lacks the semantic precision required to capture fully executable business processes. The Business Process Execution Language for Web Services (BPEL) on the other hand is a mainly block-structured language, targeted at software developers and supported by several execution platforms. In the current setting, translating BPMN models into BPEL code is a necessary step towards standards-based business process development environments. This translation is challenging since BPMN and BPEL represent two fundamentally different classes of languages. Existing BPMN-to-BPEL translations rely on the identification of block-structured patterns in BPMN models that are mapped into block-structured BPEL constructs. This paper advances the state of the art in BPMN-to-BPEL translation by defining methods for identifying not only perfectly block-structured fragments in BPMN models, but also quasi-structured fragments that can be turned into perfectly structured ones and flow-based acyclic fragments that can be mapped into a combination of block-structured constructs and control links. Beyond its direct relevance in the context of BPMN and BPEL, this paper addresses issues that arise generally when translating between graph-oriented and block-structured flow definition languages.

show abstract

“…For an approach that focuses on temporal properties without partial orders nor performance evaluation, see [4], where a Timed Automaton semantics of Orc is given and used for verification purposes using the Uppaal tool. On the other hand, a number of papers have been devoted to the Petri net semantics of the most widely used language for orchestration, namely BPEL, see [6,9,13,15,8] and the tutorial [16]. Our work is unique in that it provides a direct coding of a wide area computing language into asymmetric event structures.…”

Section: Related Workmentioning

confidence: 99%

“…Let us first show that is a partial order on G [E]. By (9) and Condition 4 of Definition 2, is a preorder on G [E]. It thus remains to show that there exists no non trivial circuit e 1 e 2 .…”

Section: A Proof Of Theoremmentioning

confidence: 99%

“…For other studies of Orc semantics see [3], where the authors link the Orc language to Petri nets and the join calculus, and [14], where Orc expressions are translated to colored Petri net systems. On the other hand, a number of papers have been devoted to the semantics of the most widely used language for orchestration, namely BPEL, see [6,9,13,15,8] and the tutorial [16]. Still, very little has been done toward getting, for orchestration languages, a semantics that is suitable for Quality of Service (QoS) studies.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Event Structure Semantics of Orc

Rosario

Kitchin

Benveniste

et al.

Lecture Notes in Computer Science

View full text Add to dashboard Cite

One challenge in developing wide-area distributed applications is analyzing the system's non-functional properties, including timing constraints and internal dependencies that can affect quality of service. Analysis of non-functional properties requires a precise formal semantics for the language in which the system is written; but labelled transition systems and trace semantics, which are commonly used for this purpose, do not facilitate this kind of analysis. Event structures provide an explicit representation of the the causal dependencies between events in the execution of a system. But event structures are difficult to construct compositionally, because they cannot easily represent fragments of a computation. In this paper we present a partial-order semantics based on heaps (an explicitly encoded form of occurrence nets with read arcs), which naturally represent fragments of behavior. Heaps are then easily translated into asymmetric event structures. The semantics is developed for Orc, an orchestration language in which concurrent services are invoked to achieve a goal while managing time-outs, exceptions, and priority. Orc, and this new semantics, are being used to study quality of service (QoS) for wide area orchestrations.Key-words: partial orders, event structures, semantics

show abstract

Analyzing Interacting BPEL Processes

Cited by 85 publications

References 15 publications

Algorithms Based on Pattern Analysis for Verification and Adapter Creation for Business Process Composition

Algorithms Based on Pattern Analysis for Verification and Adapter Creation for Business Process Composition

Pattern-Based Translation of BPMN Process Models to BPEL Web Services

Event Structure Semantics of Orc

Contact Info

Product

Resources

About