A New Strategy for Distributed Compensations with Interruption in Long-Running Transactions

DOI10.1007/978-3-642-28412-0_5zbMath1312.68126MaRDI QIDQ2890323

Ivan Lanese, Roberto Bruni, Anne Kersten, Giorgio Spagnolo

Publication date: 8 June 2012

Published in: Recent Trends in Algebraic Development Techniques (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-28412-0_5

zbMATH Keywords

compensation; Maude; long-running transactions; cCSP; Sagas

Mathematics Subject Classification ID

68P15: Database theory

68Q55: Semantics in the theory of computing

68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)

68Q42: Grammars and rewriting systems

Related Items

cJoin: Join with communicating transactions

Uses Software

• Maude

Cites Work

• Petri nets are monoids
• All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
• Petri nets with individual tokens
• Event-Based Service Coordination
• On the Expressive Power of Primitives for Compensation Handling
• Communicating Transactions
• Theoretical foundations for compensations in flow composition languages
• The Conversation Calculus: A Model of Service-Oriented Computation
• Foundations of Software Science and Computational Structures
• Communicating Sequential Processes. The First 25 Years
• CONCUR 2005 – Concurrency Theory
• Unnamed Item
• Unnamed Item