A Chu Spaces Semantics of BPEL-Like Fault Handling

2009 IEEE Asia-Pacific Services Computing Conference (APSCC)

2009

Self Cite

We present a Chu spaces semantics of typical control flow of BPEL including fault handling and link semantics. BPEL cf is proposed as a simplification of this subset of BPEL. For the compositional modeling of BPEL, we present a Chu spaces process algebra consisting of seven operators. These operators allow faults to be thrown at any point of execution and take link-based synchronization into consideration. We present the abstract syntax of BPEL cf , the semantic algebra, and the valuation functions for computing the Chu spaces denotation of BPEL cf programs. The valuation functions are straightforward because of the power of the Chu spaces process algebra.

“…Our solution is to nondeterministically choose one and cancel the other (see the definition of S6 and S6 in Sec.III-B4). A detailed discussion of this issue can be found in [3].…”

Section: Discussionmentioning

confidence: 99%

“…The operators sequence ; , concurrence and trigger are designed to deal with fault handling. They are enhanced version of those in [3]. Link semantics are supported by the incominglink • and outgoinglink • operators.…”

Section: B Semantic Algebramentioning

confidence: 99%

A Chu spaces semantics of control flow in BPEL

2009 IEEE Asia-Pacific Services Computing Conference (APSCC)

2009

Self Cite

“…First, the Chu spaces process algebra proposed in this paper can be revised or extended for the modeling of certain real-life concurrent programming languages with different characteristics. We have given a denotational semantics for a subset of WS-BPEL in [28][29] with modified versions of the Chu spaces process algebra.…”

Section: Discussionmentioning

confidence: 99%

Modeling and Verifying Concurrent Programs with Finite Chu Spaces

J. Comput. Sci. Technol.

2010

Finite Chu spaces are proposed for the modeling and verification of concurrent programs. In order to model not only typical concurrent behaviors but also modern exception handling and synchronization mechanisms, we design an enriched process algebra of Chu spaces from a practical point of view. To illustrate the power of finite Chu spaces and the process algebra while abstracting away from language-specific details, an imaginary concurrent programming language (ICL) is designed. A denotational semantics of ICL is presented using finite Chu spaces and the enriched process algebra. The valuation functions are fairly straightforward since the carefully designed operators have done much of the job. The enriched process algebra is also used as the specification language for Chu spaces, with which process-algebraic properties can be specified. Verification algorithms are presented with their time complexities discussed.

“…Our solution is to nondeterministically choose one and cancel the other. A discussion of this issue can be found in Du et al (2009a).…”

Section: Discussionmentioning

confidence: 99%

“…The operators sequence ;', concurrence ||' and trigger Å are used to deal with fault handling. They are enhanced version of those used in Du, Xing, and Zhou (2009a). Link semantics are supported by the link operator  .…”

Section: The Chu Spaces Process Algebramentioning

confidence: 99%

Modeling Control Flow in WS-BPEL with Chu Spaces

International Journal of Information Systems in the Service Sector

et al. 2011

Self Cite

This paper presents a Chu spaces semantics of typical control flow of WS-BPEL including fault handling and link semantics. BPEL-CF is proposed as a simplification of this subset of WS-BPEL. For the compositional modeling of BPEL, the authors present a Chu spaces process algebra. This algebra allows faults to be thrown at any point of execution and take link-based synchronization into consideration. The paper gives the abstract syntax of BPEL-CF, the semantic algebra, and the valuation functions for computing the Chu spaces denotations of BPEL-CF programs.