Summary
The concept of a compensable transaction has been embodied in modern business workflow languages like BPEL. This article uses the concept of a box-structured Petri net to formalise the definition of a compensable transaction. The standard definitions of structured program connectives are extended to construct longer-running transactions out of shorter fine-grain ones. Floyd-type assertions on the arcs of the net specify the intended properties of the transaction and of its component programs. The correctness of the whole transaction can therefore be proved by local reasoning.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Hoare, T. (2010). Compensable Transactions. In: Müller, P. (eds) Advanced Lectures on Software Engineering. LASER LASER 2007 2008. Lecture Notes in Computer Science, vol 6029. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13010-6_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-13010-6_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13009-0
Online ISBN: 978-3-642-13010-6
eBook Packages: Computer ScienceComputer Science (R0)