Coordinating multi-transaction activities
Coordinating multi-transaction activities
A calculus of mobile processes, II
Information and Computation
The reflexive CHAM and the join-calculus
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Comparing the expressive power of the synchronous and the asynchronous &pgr;-calculus
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
What is a “good” encoding of guarded choice?
Information and Computation - Special issue on EXPRESS 1997
A Calculus of Communicating Systems
A Calculus of Communicating Systems
An Object Calculus for Asynchronous Communication
ECOOP '91 Proceedings of the European Conference on Object-Oriented Programming
The Fusion Calculus: Expressiveness and Symmetry in Mobile Processes
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Finding and preventing run-time error handling mistakes
OOPSLA '04 Proceedings of the 19th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Theoretical foundations for compensations in flow composition languages
Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Information and Computation
Bisimilarity is not finitely based over BPA with interrupt
Theoretical Computer Science - Algebra and coalgebra in computer science
Disciplining Orchestration and Conversation in Service-Oriented Computing
SEFM '07 Proceedings of the Fifth IEEE International Conference on Software Engineering and Formal Methods
ECOWS '07 Proceedings of the Fifth European Conference on Web Services
Expressiveness of Process Algebras
Electronic Notes in Theoretical Computer Science (ENTCS)
Sessions and Pipelines for Structured Service Programming
FMOODS '08 Proceedings of the 10th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems
Towards a Unified Approach to Encodability and Separation Results for Process Calculi
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
A Process Calculus Analysis of Compensations
Trustworthy Global Computing
Dynamic Recovering of Long Running Transactions
Trustworthy Global Computing
On the expressive power of process interruption and compensation
Mathematical Structures in Computer Science
Modeling Dimensions of Self-Adaptive Software Systems
Software Engineering for Self-Adaptive Systems
Dynamic Error Handling in Service Oriented Applications
Fundamenta Informaticae - Application of Concurrency to System Design
A calculus for orchestration of web services
ESOP'07 Proceedings of the 16th European conference on Programming
The conversation calculus: a model of service-oriented computation
ESOP'08/ETAPS'08 Proceedings of the Theory and practice of software, 17th European conference on Programming languages and systems
SOCK: a calculus for service oriented computing
ICSOC'06 Proceedings of the 4th international conference on Service-Oriented Computing
Foundations of web transactions
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
SCC: a service centered calculus
WS-FM'06 Proceedings of the Third international conference on Web Services and Formal Methods
Towards a unifying theory for web services composition
WS-FM'06 Proceedings of the Third international conference on Web Services and Formal Methods
A trace semantics for long-running transactions
CSP'04 Proceedings of the 2004 international conference on Communicating Sequential Processes: the First 25 Years
Error handling: from theory to practice
ISoLA'10 Proceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part II
Advanced mechanisms for service combination and transactions
Rigorous software engineering for service-oriented systems
A new strategy for distributed compensations with interruption in long-running transactions
WADT'10 Proceedings of the 20th international conference on Recent Trends in Algebraic Development Techniques
Time and exceptional behavior in multiparty structured interactions
WS-FM'11 Proceedings of the 8th international conference on Web Services and Formal Methods
Failure-divergence semantics and refinement of long running transactions
Theoretical Computer Science
Recovery within long-running transactions
ACM Computing Surveys (CSUR)
Hi-index | 0.00 |
Modern software systems have frequently to face unexpected events, reacting so to reach a consistent state. In the field of concurrent and mobile systems (e.g., for web services) the problem is usually tackled using long running transactions and compensations: activities programmed to recover partial executions of long running transactions. We compare the expressive power of different approaches to the specification of those compensations. We consider (i) static recovery, where the compensation is statically defined together with the transaction, (ii) parallel recovery, where the compensation is dynamically built as parallel composition of compensation elements and (iii) general dynamic recovery, where more refined ways of composing compensation elements are provided. We define an encoding of parallel recovery into static recovery enjoying nice compositionality properties, showing that the two approaches have the same expressive power. We also show that no such encoding of general dynamic recovery into static recovery is possible, i.e. general dynamic recovery is strictly more expressive.