An Operational Semantics for StAC, a Language for Modelling Long-Running Business Transactions
نویسندگان
چکیده
This paper presents the StAC language and its operational semantics. StAC (Structured Activity Compensation) is a business process modelling language and a distinctive feature of the language is its support for compensation. A compensation is an action taken to recover from error or cope with a change of plan, especially when rollback of a process is not possible. StAC is similar to a process algebraic language such as Hoare’s CSP or Milner’s CCS but has additional operators dealing with compensation and with exception handling. We have developed an operational semantics for the language which is presented in this paper.
منابع مشابه
Precise Modelling of Compensating Business Transactions and its Application to BPEL
We describe the StAC language which can be used to specify the orchestration of activities in long running business transactions. Long running business transactions use compensation to cope with exceptions. StAC supports sequential and parallel behaviour as well as exception and compensation handling. We also show how the B notation may be combined with StAC to specify the data aspects of trans...
متن کاملExtending the concept of transaction compensation
The ability to compensate for previous activities, often in the case of failure or exceptional events, is an important feature of long-running business transactions. In this paper, we present several extensions to existing notions of compensation for business transactions. The extensions are described using a business process modeling language called StAC but are also placed in the context of I...
متن کاملDynamic Recovering of Long Running Transactions
Most business applications rely on the notion of long running transaction as a fundamental building block. This paper presents a calculus for modelling long running transactions within the framework of the π-calculus, with support for compensation as a recovery mechanism. The underlying model of this calculus is the asynchronous polyadic π-calculus, with transaction scopes and dynamic installat...
متن کاملAn Extended cCSP with Stable Failures Semantics
Compensating CSP (cCSP) is an extension to CSP for modeling long-running transactions. It can be used to specify programs of service orchestration written in a programming language like WS-BPEL. So far, only an operational semantics and a trace semantics are given to cCSP. In this paper, we extend cCSP with more operators and define for it a stable failures semantics in order to reason about no...
متن کاملFormal Design and Verification of Long-Running Transactions with Eclipse Coordination Tools
Ensuring transactional behavior of business processes and web service compositions is an essential issue in the area of service-oriented computing. Transactions in this context may require long periods of time to complete and must be managed using non-blocking techniques. Data integrity in Long-Running Transactions (LRTs) is preserved using compensations, that is, activities explicitly programm...
متن کامل