This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Fifth International Conference on Application of Concurrency to System Design (ACSD'05)
Dead-Path-Elimination in BPEL4WS
St. Malo, France
June 07-June 09
ISBN: 0-7695-2363-3
Franck van Breugel, York University
Mariya Koshkina, IBM Toronto Lab
Dead-path-elimination (DPE) is a key ingredient of the business process execution language for web services (BPEL4WS). In this paper, we introduce a small language called the BPE-calculus which contains those constructs of BPEL4WS that are most relevant to DPE. We present three models for the BPE-calculus: one without DPE, one with DPE, and one with our proposed modification of DPE. We formulate a condition and show that it is sufficient and necessary for (modified) DPE to be free of (unintended) side effects. More precisely, we prove the following two properties. First of all, if the condition is satisfied, then the behaviour of a BPE-process is the same in the model without DPE and the model with (modified) DPE. Secondly, if the condition is not satisfied, then we can construct a BPE-process that behaves differently in the models. As a consequence, if the condition is satisfied, then DPE becomes an optimisation. In that case, programmers can ignore DPE and, hence, programming in BPEL4WS becomes simpler.
Citation:
Franck van Breugel, Mariya Koshkina, "Dead-Path-Elimination in BPEL4WS," acsd, pp.192-201, Fifth International Conference on Application of Concurrency to System Design (ACSD'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.