Specification and verification of fault-tolerance, timing, and scheduling
ACM Transactions on Programming Languages and Systems (TOPLAS)
A Calculus of Communicating Systems
A Calculus of Communicating Systems
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
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
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
Dynamic Recovering of Long Running Transactions
Trustworthy Global Computing
Towards Formal Interfaces for Web Services with Transactions
Advanced Internet Based Systems and Applications
On the expressive power of process interruption and compensation
Mathematical Structures in Computer Science
PVS Embedding of cCSP Semantic Models and Their Relationship
Electronic Notes in Theoretical Computer Science (ENTCS)
A calculus for orchestration of web services
ESOP'07 Proceedings of the 16th European conference on Programming
An extended cCSP with stable failures semantics
ICTAC'10 Proceedings of the 7th International colloquium conference on Theoretical aspects of computing
Failure-divergence refinement of compensating communicating processes
FM'11 Proceedings of the 17th international conference on Formal methods
SOCK: a calculus for service oriented computing
ICSOC'06 Proceedings of the 4th international conference on Service-Oriented Computing
rCOS: theory and tool for component-based model driven development
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
A generic theorem prover of CSP refinement
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Foundations of web transactions
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
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
Towards a unifying theory for web services composition
WS-FM'06 Proceedings of the Third international conference on Web Services and Formal Methods
Modeling long–running transactions with communicating hierarchical timed automata
FMOODS'06 Proceedings of the 8th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems
On the expressive power of primitives for compensation handling
ESOP'10 Proceedings of the 19th European conference on Programming Languages and Systems
A trace semantics for long-running transactions
CSP'04 Proceedings of the 2004 international conference on Communicating Sequential Processes: the First 25 Years
| Hi-index | 5.23 |
Compensating CSP (cCSP) models long-running transactions. It can be used to specify service orchestrations written in programming languages like WS-BPEL. However, the original cCSP does not allow to model internal (non-deterministic) choice, synchronized parallel composition, hiding or recursion. In this paper, we introduce these operators and define for the extended language a failure-divergence (FD) semantics to allow reasoning about non-determinism, deadlock and livelock. Furthermore, we develop a refinement calculus that allows us to compare the level of non-determinism between long running transactions, and transform specifications for design and analysis.