An extended cCSP with stable failures semantics

Authors:
Zhenbang Chen;Zhiming Liu
Affiliations:
National Laboratory for Parallel and Distributed Processing, Changsha, China;International Institute for Software Technology, United Nations University, Macao SAR, China
Venue:
ICTAC'10 Proceedings of the 7th International colloquium conference on Theoretical aspects of computing
Year:
2010

Citing 8
Cited 2

Sagas

SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
The Theory and Practice of Concurrency

The Theory and Practice of Concurrency
Transactions and Web services

Communications of the ACM - Service-oriented computing
Theoretical foundations for compensations in flow composition languages

Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Comparing two approaches to compensable flow composition

CONCUR 2005 - Concurrency Theory
PVS Embedding of cCSP Semantic Models and Their Relationship

Electronic Notes in Theoretical Computer Science (ENTCS)
Executable semantics for compensating CSP

EPEW'05/WS-FM'05 Proceedings of the 2005 international conference on European Performance Engineering, and Web Services and Formal Methods, international conference on Formal Techniques for Computer Systems and Business Processes
A trace semantics for long-running transactions

CSP'04 Proceedings of the 2004 international conference on Communicating Sequential Processes: the First 25 Years

Failure-divergence refinement of compensating communicating processes

FM'11 Proceedings of the 17th international conference on Formal methods
Failure-divergence semantics and refinement of long running transactions

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 nondeterminism and deadlock. We give some important algebraic laws for the new operators. These laws can be justified and understood from the stable failures semantics. A case study is given to demonstrate the extended cCSP.