CSP is a process algebra defined by Hoare. A long-running transaction is an interaction of components from different systems which must be executed as a single atomic action. Ensuring consistency is important for long-running transaction. Because long-running transaction often needs cross-organizational services composition and could not use ACID semantic, so CSP is used to ensure the consistency of the long-running transaction. We use CSP process algebra to build a long-running transaction model. By listing all feasible process executions, then use an algorithm to make the verify problem propositional validity. The case study shows that the application is effective.

No abstract