More Web Proxy on the site http://driver.im/

Article

Theoretical foundations for compensations in flow composition languages

Authors:

Hernán Melgratti,

Ugo MontanariAuthors Info & Claims

POPL '05: Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages

Pages 209 - 220

https://doi.org/10.1145/1040305.1040323

Published: 12 January 2005 Publication History

Abstract

A key aspect when aggregating business processes and web services is to assure transactional properties of process executions. Since transactions in this context may require long periods of time to complete, traditional mechanisms for guaranteeing atomicity are not always appropriate. Generally the concept of long running transactions relies on a weaker notion of atomicity based on compensations. For this reason, programming languages for service composition cannot leave out two key aspects: compensations, i.e. ad hoc activities that can undo the effects of a process that fails to complete, and transactional boundaries to delimit the scope of a transactional flow. This paper presents a hierarchy of transactional calculi with increasing expressiveness. We start from a very small language in which activities can only be composed sequentially. Then, we progressively introduce parallel composition, nesting, programmable compensations and exception handling. A running example illustrates the main features of each calculus in the hierarchy.

References

[1]

W. Aalst, M. Dumas, and A. Hofstede. Web service composition languages: Old wine in new bottles? Proc. of EUROMICRO'03, pp. 298--307. IEEE Computer Society, 2003.

Digital Library

[2]

W. Aalst, M. Dumas, and A. Hofstede, and P. Wohed, Analysis of web services composition languages: The case of bpel4ws. Proc. of ER'03, vol. 2813 of LNCS, pp. 200--215. Springer, 2003.

[3]

B. Benatallah and R. Hamadi. A Petri net-based model for web service composition. Proc. of ADC'03, pp. 191--200. Australian Computer Society, 2003.

Digital Library

[4]

L. Bocchi, C. Laneve, and G. Zavattaro. A calculus for long-running transactions. Proc. of FMOODS'03, vol. 2884 of LNCS, pp. 124--138. Springer, 2003.

[5]

bpel Specification. Version 1.1. Available at http://www.ibm.com/developerworks/library/ws-bpel.

[6]

Business process modelling language (bpml). http://www.bpmi.org.

[7]

A. Brogi, C. Canal, E. Pimentel, and A. Vallecillo. Formalizing web services choreographies. Proc. of WS-FM'04. To appear as ENTCS.

Digital Library

[8]

R. Bruni, H. Melgratti, and U. Montanari. Nested commits for mobile calculi: extending Join. Proc. of IFIP-TCS'04, pp. 569--582. Kluwer, 2004.

[9]

M. Butler, M. Chessell, C. Ferreira, C. Griffin, P. Henderson, and D. Vines. Extending the concept of transaction compensation. IBM Systems Journal, 41(4):743--758, 2002.

Digital Library

[10]

M. Butler and C. Ferreira. An operational semantics for StAC, a language for modelling long-running business transactions. Proc. of Coordination'04, vol. 2949 of LNCS, pp. 87--104. Springer, 2004.

[11]

P. Chrysanthis and K. Ramamritham. Transaction Models for Advanced Applications, acta: The saga Continues, pp. 349---397. Morgan Kaufmann, 1992.

Digital Library

[12]

H. Garcia-Molina and K. Salem. Sagas. Proc. of ACM SIGMOD'87, pp. 249--259. ACM Press, 1987.

Digital Library

[13]

D. Georgakopoulos, M. Hornick, and A. Sheth. An overview of workflow management: From process modeling to workflow automation infrastructure. Distributed and Parallel Databases, 3(2):119--153, 1995.

Digital Library

[14]

C. Hoare. Long-running transactions. Slides for the Second Microsoft .NET Crash Course 2002. http://research.microsoft.com/Collaboration/University/Europe/Events/dotnetcc/Version2.

[15]

A. Hosking, S. Jagannathan, J. Vitek, and A. Welc. A semantic framework for designer transactions. Proc. of ESOP'04, vol. 2986 of LNCS, pp. 249--263. Springer, 2004.

[16]

F. Leymann. The wsfl Guide. Available at http://www.ibm.com/software/solutions/webservices/documentation.html.

[17]

M. Mazzara and R. Lucchi. A framework for generic error handling in business processes. Proc. WS-FM'04. To appear as ENTCS.

Digital Library

[18]

L. G. Meredith and S. Bjorg. Contracts and types. Commun. ACM, 46(10):41--47, 2003.

Digital Library

[19]

J. Moss. Nested Transactions: An Approach to Reliable Distributed Computing. PhD thesis, Dept. of Electrical Eng. and Computer Sci., MIT, 1981.

[20]

A. Sheth and D. Worah. Transactions in transactional workflows. Advanced Transaction Models and Architectures, pp. 3--34. Kluwer, 1997.

[21]

S. Thatte. xlang: Web Services for Business Process Design. Available at http://www.gotdotnet.com/team/xml_wsspecs/xlang-c.

[22]

M. Viroli. Towards a formal foundation to orchestration languages. Proc. of WS-FM'04. To appear as ENTCS.

Digital Library

[23]

WebSphere Software Platform. IBM. Available at http://www.ibm.com/software/websphere.

[24]

wsci Specification. Version 1.0. Available at http://www.w3.org/TR/wsci.

Cited By

Changizi BKokash NArbab F(2019)Service Orchestration with Priority ConstraintsFundamentals of Software Engineering10.1007/978-3-030-31517-7_14(194-209)Online publication date: 1-May-2019
https://dl.acm.org/doi/10.1007/978-3-030-31517-7_14
Colombo CPace G(2014)Comprehensive Monitor-Oriented Compensation ProgrammingElectronic Proceedings in Theoretical Computer Science10.4204/EPTCS.147.4147(47-61)Online publication date: 2-Apr-2014
https://doi.org/10.4204/EPTCS.147.4
Al-Humaimeedy AFernández M(2014)General dynamic recovery for compensating CSPElectronic Proceedings in Theoretical Computer Science10.4204/EPTCS.143.1143(3-16)Online publication date: 29-Mar-2014
https://doi.org/10.4204/EPTCS.143.1
Show More Cited By

Index Terms

Theoretical foundations for compensations in flow composition languages

Recommendations

Theoretical foundations for compensations in flow composition languages
Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages

A key aspect when aggregating business processes and web services is to assure transactional properties of process executions. Since transactions in this context may require long periods of time to complete, traditional mechanisms for guaranteeing ...
Transactional Composition of Nonblocking Data Structures
PPoPP '23: Proceedings of the 28th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming

We introduce nonblocking transaction composition (NBTC), a new methodology for atomic composition of nonblocking operations on concurrent data structures. Unlike previous software transactional memory (STM) approaches, NBTC leverages the linearizability ...
Transactional Composition of Nonblocking Data Structures
SPAA '23: Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures

This paper introduces nonblocking transaction composition (NBTC), a new methodology for atomic composition of nonblocking operations on concurrent data structures. Unlike previous software transactional memory (STM) approaches, NBTC leverages the ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences

POPL '05: Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages

January 2005

402 pages

ISBN:158113830X

DOI:10.1145/1040305

General Chair:
Jens Palsberg
University of California, Los Angeles, CA
,
Program Chair:
Martín Abadi
University of California, Santa Cruz, CA

ACM SIGPLAN Notices Volume 40, Issue 1
Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
January 2005
391 pages
ISSN:0362-1340
EISSN:1558-1160
DOI:10.1145/1047659
Issue’s Table of Contents

Copyright © 2005 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 12 January 2005

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

POPL05

Sponsor:

POPL05: The 32nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages 2005

January 12 - 14, 2005

California, Long Beach, USA

Acceptance Rates

Overall Acceptance Rate 824 of 4,130 submissions, 20%

Upcoming Conference

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

146
Total Citations
View Citations
1,013
Total Downloads

Downloads (Last 12 months)8
Downloads (Last 6 weeks)1

Reflects downloads up to 26 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Changizi BKokash NArbab F(2019)Service Orchestration with Priority ConstraintsFundamentals of Software Engineering10.1007/978-3-030-31517-7_14(194-209)Online publication date: 1-May-2019
https://dl.acm.org/doi/10.1007/978-3-030-31517-7_14
Colombo CPace G(2014)Comprehensive Monitor-Oriented Compensation ProgrammingElectronic Proceedings in Theoretical Computer Science10.4204/EPTCS.147.4147(47-61)Online publication date: 2-Apr-2014
https://doi.org/10.4204/EPTCS.147.4
Al-Humaimeedy AFernández M(2014)General dynamic recovery for compensating CSPElectronic Proceedings in Theoretical Computer Science10.4204/EPTCS.143.1143(3-16)Online publication date: 29-Mar-2014
https://doi.org/10.4204/EPTCS.143.1
Mazzara MCiavotta M(2014)Issues about the Adoption of Formal Methods for Dependable Composition of Web ServicesInternational Journal of Systems and Service-Oriented Engineering10.4018/ijssoe.20141001034:4(35-50)Online publication date: 1-Oct-2014
https://dl.acm.org/doi/10.4018/ijssoe.2014100103
BOCCHI LTUOSTO E(2014)Attribute-based transactions in service oriented computingMathematical Structures in Computer Science10.1017/S096012951200090425:3(619-665)Online publication date: 10-Nov-2014
https://doi.org/10.1017/S0960129512000904
Biswas DGenest B(2014)Privacy preserving minimal observability for composite transactional servicesDiscrete Event Dynamic Systems10.1007/s10626-013-0177-z24:4(611-646)Online publication date: 1-Dec-2014
https://dl.acm.org/doi/10.1007/s10626-013-0177-z
Liu XYang SSanders J(2014)Compensation by designFormal Aspects of Computing10.1007/s00165-013-0275-626:4(623-676)Online publication date: 1-Jul-2014
https://dl.acm.org/doi/10.1007/s00165-013-0275-6
Reiff-Marganiec SAli M(2013)Maintaining Transactional Integrity in Long Running Workflow ServicesService-Driven Approaches to Architecture and Enterprise Integration10.4018/978-1-4666-4193-8.ch006(135-164)Online publication date: 2013
https://doi.org/10.4018/978-1-4666-4193-8.ch006
Colombo CPace G(2013)Recovery within long-running transactionsACM Computing Surveys10.1145/2480741.248074545:3(1-35)Online publication date: 3-Jul-2013
https://dl.acm.org/doi/10.1145/2480741.2480745
Ramalingam GVaswani K(2013)Fault tolerance via idempotenceACM SIGPLAN Notices10.1145/2480359.242910048:1(249-262)Online publication date: 23-Jan-2013
https://dl.acm.org/doi/10.1145/2480359.2429100
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten