Research on Long Running Transaction Consistency Based on CSP Trace Semantic

A long-running transaction is an interaction of components from different systems. It must be executed as a single atomic action. The typical atomic technologies are not suitable for long-running transaction. Because long-running transaction could not use ACID semantic, this paper uses the set consistency notion and CSP to define the consistency of the long-running transaction. We give an algorithm to verify set consistency. The case study shows that the approach is effective.