Communicating sequential processes
Communicating sequential processes
Non-deterministic expressions and predicate transformers
Information Processing Letters
A calculus for cryptographic protocols
Information and Computation
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
A Discipline of Programming
A Process Compensation Language
IFM '00 Proceedings of the Second International Conference on Integrated Formal Methods
Theoretical foundations for compensations in flow composition languages
Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Validating a web service security abstraction by typing
Formal Aspects of Computing
Validating a web service security abstraction by typing
Formal Aspects of Computing
A semantics for web services authentication
Theoretical Computer Science - Theoretical foundations of security analysis and design II
TGC'05 Proceedings of the 1st international conference on Trustworthy global computing
Towards the semantics for web service choreography description language
ICFEM'06 Proceedings of the 8th international conference on Formal Methods and Software Engineering
Semantics of BPEL4WS-Like fault and compensation handling
FM'05 Proceedings of the 2005 international conference on Formal Methods
From theory to practice in transactional composition of web services
EPEW'05/WS-FM'05 Proceedings of the 2005 international conference on European Performance Engineering, and Web Services and Formal Methods, international conference on Formal Techniques for Computer Systems and Business Processes
A trace semantics for long-running transactions
CSP'04 Proceedings of the 2004 international conference on Communicating Sequential Processes: the First 25 Years
| Hi-index | 0.00 |
Transaction-based services are increasingly being applied in solving many universal interoperability problems. Compensation is one typical feature for long-running transactions. This paper presents a design model for specifying the behaviour of compensable programs. The new model for handling exception and compensation is built as conservative extension of the standard relational model. The paper puts forward a mathematical framework for transactions where a transaction is treated as a mapping from its environment to compensable programs. We propose a transaction refinement calculus, and show that every transaction can be converted to a primitive one which simply consists of a forward activity and a compensation module.