Failure-divergence refinement of compensating communicating processes

Authors:
Zhenbang Chen;Zhiming Liu;Ji Wang
Affiliations:
National Laboratory for Parallel and Distributed Processing, Changsha, China;International Institute for Software Technology, The United Nations University, Macao;National Laboratory for Parallel and Distributed Processing, Changsha, China
Venue:
FM'11 Proceedings of the 17th international conference on Formal methods
Year:
2011

Citing 13
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
Transaction Processing: Concepts and Techniques

Transaction Processing: Concepts and Techniques
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
Ensuring consistency in long running transactions

Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering
A theory of contracts for web services

Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The Three Platonic Models of Divergence-Strict CSP

Proceedings of the 5th international colloquium on Theoretical Aspects of Computing
PVS Embedding of cCSP Semantic Models and Their Relationship

Electronic Notes in Theoretical Computer Science (ENTCS)
An extended cCSP with stable failures semantics

ICTAC'10 Proceedings of the 7th International colloquium conference on Theoretical aspects of computing
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 semantics and refinement of long running transactions

Theoretical Computer Science
Towards a formal integrated model of collaborative healthcare workflows

FHIES'11 Proceedings of the First international conference on Foundations of Health Informatics Engineering and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Compensating CSP (cCSP) extends CSP for specification and verification of long running transactions. The original cCSP is a modest extension to a subset of CSP that does not consider non-deterministic choice, synchronized composition, and recursion. There are a few further extensions. However, it remains a challenge to develop a fixed-point theory of process refinement in cCSP. This paper provides a complete solution to this problem and develops a theory of cCSP, corresponding to the theory of CSP, so that the verification techniques and their tools, such as FDR, can be extended for compensating processes.