Transforming BPEL to Petri Nets

Hinz, Sebastian; Schmidt, Karsten; Stahl, Christian

doi:10.1007/11538394_15

Cited by 201 publications

(121 citation statements)

References 12 publications

Supporting

Mentioning

121

Contrasting

Order By: Relevance

“…As shown [21,30,45] there are solutions to translate a BPEL Managing special cases of a process by introducing policies.…”

Section: Discussionmentioning

confidence: 99%

“…Especially if during the execution of a CWS there is the choice between two paths that can run for a long time, then the knowledge whether The model-aware middleware aims to enhance the already existing language to implement CWSs, which is BPEL. There are already works, which investigates how to translate the process in BPEL into Petri Nets formalism (for example in: [21], [30], [45]). Therefore this thesis focuses more on the runtime aspects of using the CPN.…”

Section: Application Areasmentioning

confidence: 99%

See 1 more Smart Citation

Model Aware Execution of Composite Web Services

Zurowska

Deters

2009

2009 IEEE International Conference on Services Computing

View full text Add to dashboard Cite

In the Service Oriented Architecture (SOA) services are computational elements that are published, discovered, consumed and aggregated across platform and organizational borders. The most commonly used technology to achieve SOA are Web Services (WSs). This is due to standardization process (WSDL, SOAP, UDDI standards) and a wide range of available infrastructure and tools. A very interesting aspect of WSs is their composeability. WSs can be easily aggregated into complex workflows, called Composite Web Services (CWSs). These compositions of services enable further reuse and in this way new, even more complex, systems are built.Although there are many languages to specify or implement workflows, in the service-oriented systems BPEL (Business Process Execution Language) is widely accepted. With this language WSs are orchestrated and then executed with specialized engines (like ActiveBPEL). While being very popular, BPEL has certain limitations in monitoring and optimizing executions of CWSs. It is very hard with this language to adapt CWSs to changes in the performance of used WSs, and also to select the optimal way to execute a CWS.To overcome the limitations of BPEL, I present a model-aware approach to execute CWSs. To achieve the model awareness the Coloured Petri Nets (CPN) formalism is considered as the basis of the execution of CWSs. This is different than other works in using formal methods in CWSs, which are restricted to purposes like verification or checking of correctness. Here the formal and unambiguous notation of the CPN is used to model, analyze, execute and monitor CWSs. Furthermore this approach to execute CWSs, which is based on the CPN formalism, is implemented in the model-aware middleware. It is also demonstrated how the middleware improves the performance and reliability of CWSs.ii

show abstract

“…As shown [21,30,45] there are solutions to translate a BPEL Managing special cases of a process by introducing policies.…”

Section: Discussionmentioning

confidence: 99%

Section: Application Areasmentioning

confidence: 99%

Model Aware Execution of Composite Web Services

Zurowska

Deters

2009

2009 IEEE International Conference on Services Computing

View full text Add to dashboard Cite

show abstract

“…Recently, a number of research efforts on the verification of the web service composition have been activated including [3]- [8]. Even though all of them are successful in unraveling weaknesses of verification of web service composition, they do not consider timing constraints of business processes.…”

Section: Introductionmentioning

confidence: 99%

“…Since creating composite web services is more complex task, formal verification of WS-BPEL is essential to guarantee the correctness and reliability of web service compositions with timing constraints [2]. However, WS-BPEL has some defect on verification.Recently, a number of research efforts on the verification of the web service composition have been activated including [3]- [8]. Even though all of them are successful in unraveling weaknesses of verification of web service composition, they do not consider timing constraints of business processes.…”

mentioning

confidence: 99%

Partial Order Reduction for Verification of WS-BPEL

Pradubsuwun¹,

Kongburan²

2014

IJMO

View full text Add to dashboard Cite

Abstract-Webservice-business process execution Language (WS-BPEL) is a promising language for describing a web service composition. Unfortunately, WS-BPEL lacks expressive power of formal semantics to support verifiability. Consequently, timed trace theory has been used to assure the correctness and reliability of the web service composition with timing constraints. Moreover, since most of business processes are more complicated, the cost of verification is high. It is likely that the state explosion problem will take place. In order to tackle this problem, in this paper a partial order reduction algorithm for timed trace theoretic verification has been applied to minimize the number of states. Experimenting with a tourism information system, the proposed approach expresses its effectiveness.Index Terms-Partial order reduction, timed trace theory, web service composition. I. INTRODUCTIONWeb service composition is an ability to integrate existing web services together to fulfill the practical requirements. Presently, WS-BPEL (Web Service-Business Process Execution Language) [1] has been introduced to composite web services. Since creating composite web services is more complex task, formal verification of WS-BPEL is essential to guarantee the correctness and reliability of web service compositions with timing constraints [2]. However, WS-BPEL has some defect on verification.Recently, a number of research efforts on the verification of the web service composition have been activated including [3]- [8]. Even though all of them are successful in unraveling weaknesses of verification of web service composition, they do not consider timing constraints of business processes. Therefore, [9]- [13] have been proposed formal semantics for verifying WS-BPEL with timing constraints. Whereas they are not able to detect safety and timing failures, timed trace theoretic verification proposed in [14] does. Using this approach, a specification and implementations are modeled by time Petri net [15] and conformance relation between them is checked.However, since practically most of businesses processes not only involve functionality but also involve the timing constraints, they are quite complicated interactions. The cost of verification is rather high. It is likely that the number of states may explode or the state explosion problem will occur. Hence, a partial order reduction algorithm for timed trace theoretic verification [16] has been applied to reduce the number of states while verifying the web service composition with timing constraints. This paper is organized as follows. Timed trace theoretic verification and its partial order reduction algorithm are described in the Section II. How to transform WS-BPEL into time Petri net is explained in the Section III. Then, experimenting with a case study is demonstrated in the Section IV. Finally, the conclusion is given in the Section V. II. PARTIAL ORDER REDUCTION FOR TIMED TRACE THEORETIC VERIFICATIONSince our approach relies on the framework of partial order reduction for timed t...

show abstract

“…For example, a component holding a purely sequential structure should be mapped onto a BPEL sequence construct while a component holding a parallel structure should be mapped onto a flow construct. 6 The total order defined over the set of outgoing flows of an XOR decision gateway is to capture the fact that these flows are evaluated in order and the "default flow" is the one evaluated at last. This is part of the semantics of XOR decision gateways as defined in the BPMN specification.…”

Section: Decomposing a Bpd Into Componentsmentioning

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

Transforming BPEL to Petri Nets

Cited by 201 publications

References 12 publications

Model Aware Execution of Composite Web Services

Model Aware Execution of Composite Web Services

Partial Order Reduction for Verification of WS-BPEL

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

Contact Info

Product

Resources

About