Automatic Protocol Conformance Checking of Recursive and Parallel BPEL Systems

Both, Andreas; Zimmermann, Wolf

doi:10.1109/ecows.2008.11

Cited by 14 publications

(10 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Since Petri nets cannot model unbounded recursion, they cannot be used for an integrated behavioral model. In [4] we showed that Process Rewrite Systems (PRS) can be used for that purpose, since they capture unbound parallelism as well as unbound recursion.…”

Section: Motivationmentioning

confidence: 99%

“…We use service protocols for the representation of these constraints in a component-based architecture, or Serviceoriented Architecture [4]. Service protocols contain all legal sequences of interactions with a service.…”

Section: Motivationmentioning

confidence: 99%

“…We denote the invocation implementation at the interface definitions and we accept services implemented in any imperative or object-oriented programming language [4].…”

Section: B Components/web Servicesmentioning

confidence: 99%

“…Service protocols are used, e. g., to avoid (uncaught) exceptions (like division by zero, cf. [4]) during execution, or to obey business rules (cf. [5]).…”

Section: Service Protocolsmentioning

confidence: 99%

“…The (automatic) abstraction of the source code to the PRS can be implemented using standard compiler technology. For details we refer to [4], [5].…”

Section: Abstractionsmentioning

confidence: 99%

See 4 more Smart Citations

On More Predictable Implementations of Reliable Workflows in Service-oriented Architectures

Both¹,

Zimmermann²

2009

2009 Seventh IEEE European Conference on Web Services

Self Cite

View full text Add to dashboard Cite

Implementing a workflow using previously implemented services is a typical task while dealing with Service-oriented Architectures (SOA). Defining these workflows is the task of business (process) analysts in tight collaboration with clients or domain experts. Unfortunately these analysts only have a sketchy view on the Service-oriented Architecture, thus they do not know which investigations a specific new workflow will trigger.In earlier works we have shown how a Service-oriented Architecture can be hedged using so called protocols. In this work we will show how this concept can be made available for the business analysts. This will result in faster and more predictable implementation costs and behavior of the wished workflow. In contrast to other works, our approach uses an integrated view on business processes, i. e., the behavior of services used by business processes is taken into account. Our approach closes the gap between the business analysts and the Web Service developers by using an automatic approach. Moreover, previously existing works on analyzing workflows can be integrated within our approach.

show abstract

Section: Motivationmentioning

confidence: 99%

Section: Motivationmentioning

confidence: 99%

“…We denote the invocation implementation at the interface definitions and we accept services implemented in any imperative or object-oriented programming language [4].…”

Section: B Components/web Servicesmentioning

confidence: 99%

“…Service protocols are used, e. g., to avoid (uncaught) exceptions (like division by zero, cf. [4]) during execution, or to obey business rules (cf. [5]).…”

Section: Service Protocolsmentioning

confidence: 99%

“…The (automatic) abstraction of the source code to the PRS can be implemented using standard compiler technology. For details we refer to [4], [5].…”

Section: Abstractionsmentioning

confidence: 99%

See 3 more Smart Citations

On More Predictable Implementations of Reliable Workflows in Service-oriented Architectures

Both¹,

Zimmermann²

2009

2009 Seventh IEEE European Conference on Web Services

Self Cite

View full text Add to dashboard Cite

show abstract

Verifying compositional equivalence between web service composition graphs

Gopal

Gangadharan

2018

Concurrency and Computation

View full text Add to dashboard Cite

Given a composition request, the formation of possible Web Service Composition Graphs (WSCGs) depends on the set of available services. Since the availability of Web services is dynamic, at any time, a new service can join or an existing service can leave the set of available services. A change in the set may bring the structural change in a previously formed WSCG. However, it is not always the case that a structural change in the WSCG brings the semantic change. In this paper, our aim is to verify the compositional equivalence between two WSCGs formed before and after the structural change caused by the change in the set of available services. Our proposed solution is based on an algebraic formalism, and by using the formalism, directed acyclic WSCGs are formed for a given composition request. Then, by using WSCGs, we propose the concept of composition expression and canonical composition expression. On the basis of the proposed concept of canonical composition expression, we verify compositional equivalence between two WSCGs. The advantage of our approach is that it reduces the equivalence verification to the subsumption checking between two algebraic expressions instead of directly using the WSCGs and solving a subgraph matching problem. The proposed mechanism is implemented and evaluated for the exhaustive possibilities in a travel agency case study with respect to a given composition request. INTRODUCTIONService-oriented computing is a well-established computing paradigm developed over time and still passing through phases of technological refinements day by day. Nowadays, automatic and dynamic Web service composition is in focus of the service-oriented computing research. 1,2 As far as automatic and dynamic service composition is concerned, the dynamic reconfiguration of services is a key factor worth considering because the availability of candidate Web services cannot be specified before the runtime. Thus, the dynamic availability of services greatly affects the formation of a composition plan (made for a composition request). In this paper, our focus is on the graphical composition plans (say, Web service composition graph).In general, by means of a Web Service Composition Graph (WSCG), we refer to the graphical representation of how a set of Web services compose with each other in order to realize a composition request (composition request is formally defined in the Section 4). A WSCG depends on the set of available services. Therefore, a change in the set may bring the structural change in the previously formed WSCG. However, this is not always the case that a structural change in the WSCG brings the semantic change. For an illustration of the problem of compositional equivalence between two WSCGs, let us consider three services TA1, TA2, and HB1, where TA1 and TA2 are composite services and HB1 is a basic service. The all three services accept request for hotel booking. Suppose a user requests TA1 for the hotel booking (written as ⟨TA1, H_Book⟩). Since TA1 is a composite service, it has to take the he...

show abstract

Improving Process Portability Through Metrics and Continuous Inspection

Lenhard

2017

Advances in Intelligent Process-Aware Information Systems

View full text Add to dashboard Cite

Automatic Protocol Conformance Checking of Recursive and Parallel BPEL Systems

Cited by 14 publications

References 30 publications

On More Predictable Implementations of Reliable Workflows in Service-oriented Architectures

On More Predictable Implementations of Reliable Workflows in Service-oriented Architectures

Verifying compositional equivalence between web service composition graphs

Improving Process Portability Through Metrics and Continuous Inspection

Contact Info

Product

Resources

About