Abstract

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 prepositional validity. The case study shows that the application is effective.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.