|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
| | ||
| Search | ||
| ||
Formal Design and Verification of Long-Running Transactions with Eclipse Coordination Tools
PrePrint
ISSN: 1939-1374
| ASCII Text | x | ||
| Natallia Kokash, Farhad Arbab, "Formal Design and Verification of Long-Running Transactions with Eclipse Coordination Tools," IEEE Transactions on Services Computing, vol. 99, no. 1, pp. , , 5555. | |||
| BibTex | x | ||
| @article{ 10.1109/TSC.2011.46, author = {Natallia Kokash and Farhad Arbab}, title = {Formal Design and Verification of Long-Running Transactions with Eclipse Coordination Tools}, journal ={IEEE Transactions on Services Computing}, volume = {99}, number = {1}, issn = {1939-1374}, year = {5555}, doi = {http://doi.ieeecomputersociety.org/10.1109/TSC.2011.46}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Services Computing TI - Formal Design and Verification of Long-Running Transactions with Eclipse Coordination Tools IS - 1 SN - 1939-1374 SP EP EPD - A1 - Natallia Kokash, A1 - Farhad Arbab, PY - 5555 KW - Business Process Modeling KW - Formalization of Services Composition KW - Long-Running Transactions KW - Verifiable design VL - 99 JA - IEEE Transactions on Services Computing ER - | |||
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TSC.2011.46
Ensuring transactional behavior of business processes and web service compositions is an essential issue in the area of service-oriented computing. Transactions in this context may require long periods of time to complete and must be managed using non-blocking techniques. Data integrity in Long-Running Transactions (LRTs) is preserved using compensations, that is, activities explicitly programmed to eliminate the effects of a process terminated by a user or that failed to complete due to another reason. In this paper, we present a framework for behavioral modeling of business processes, focusing on their transactional properties. Our solution is based on the channel-based exogenous coordination language Reo, which is an expressive, compositional and semantically precise design language admitting formal reasoning. The operational semantics of Reo is given by constraint automata. We illustrate how Reo can be used for modeling termination and compensation handling in a number of commonly-used workflow patterns. Furthermore, we show how essential properties of LRTs can be expressed in LTL and CTL-like logics and verified using model checking technology. Our framework is supported by a number of Eclipse plug-ins that provide facilities for modeling, animation, and verification of LRTs to generate executable code for them.
Index Terms:
Business Process Modeling, Formalization of Services Composition , Long-Running Transactions, Verifiable design
Citation:
Natallia Kokash, Farhad Arbab, "Formal Design and Verification of Long-Running Transactions with Eclipse Coordination Tools," IEEE Transactions on Services Computing, 28 July 2011. IEEE computer Society Digital Library. IEEE Computer Society, <http://doi.ieeecomputersociety.org/10.1109/TSC.2011.46>
Usage of this product signifies your acceptance of the Terms of Use.

