SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Theoretical foundations for compensations in flow composition languages
Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Comparing two approaches to compensable flow composition
CONCUR 2005 - Concurrency Theory
Looking into Compensable Transactions
SEW '07 Proceedings of the 31st IEEE Software Engineering Workshop
Modeling and Verifying Web Services Choreography Using Process Algebra
SEW '07 Proceedings of the 31st IEEE Software Engineering Workshop
A denotational approach to scope-based compensable flow language for web service
ASIAN'06 Proceedings of the 11th Asian computing science conference on Advances in computer science: secure software and related issues
Towards the semantics for web service choreography description language
ICFEM'06 Proceedings of the 8th international conference on Formal Methods and Software Engineering
Executable semantics for compensating CSP
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
Theoretical foundations of scope-based compensable flow language for web service
FMOODS'06 Proceedings of the 8th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems
A trace semantics for long-running transactions
CSP'04 Proceedings of the 2004 international conference on Communicating Sequential Processes: the First 25 Years
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
Linking denotational semantics with operational semantics for web services
Innovations in Systems and Software Engineering
ICFEM'10 Proceedings of the 12th international conference on Formal engineering methods and software engineering
Recovery within long-running transactions
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
This paper presents the algebraic semantics of a novel transactional language t-calculus. This language focuses on modeling long running transactions in terms of compensable transactions, showing how the compensations can be orchestrated to ensure atomicity. The typical operators of sequential and parallel compositions are redefined so that the corresponding compensations will be activated in a suitable order whenever some failure occurs in later stage. In addition, we investigate more transactional operators, such as speculative choice, exception handling, alternative forwarding and programmable compensation. The wise use of these constructs is rather helpful to set up a flexible and effective business process.We present a clear algebraic semantics for t-calculus and derive its operational semantics mechanically based on a given derivation strategy. This work provides a foundation for optimization and implementation of this language.