Specifying and Verifying Web Transactions
FORTE '08 Proceedings of the 28th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
An Observational Model for Transactional Calculus of Services Orchestration
Proceedings of the 5th international colloquium on Theoretical Aspects of Computing
Challenges in the Specification of Full Contracts
IFM '09 Proceedings of the 7th International Conference on Integrated Formal Methods
Linking denotational semantics with operational semantics for web services
Innovations in Systems and Software Engineering
Model checking workflow monitors and its application to a pain management process
FHIES'11 Proceedings of the First international conference on Foundations of Health Informatics Engineering and Systems
A Model Slicing Method for Workflow Verification
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
Different from traditional transactions, a compensable transaction relies on compensations to amend partial execution whenever an error occurs. The compensation is preserved on successful completion of its forward transaction for possibly later use. In this paper, we pay attention to the compositional structure of compensable transactions. Except for sequential and parallel compositions, other useful compositional constructs, such as speculative choice, exception handling, alternative forwarding and programmable compensation, are also investigated. All these constructs are not only devised to describe distinct business flow but also used to enhance the capability for dealing with errors. t-calculus is such a transactional language that involves a variety of primitives for composing compensable transactions in a wise way. We present a clear operational semantics for this language and the corresponding concept of bisimulation is defined, which is used to derive equational laws for compensable transactions.