True concurrency in long-running transactions for digital ecosystems

DOI10.3233/FI-2015-1222MaRDI QIDQ2804190zbMATH OpenFDO

Authors Sotiris Moschoyiannis, Paul J. Krause

Publication date 28 April 2016

Published in Fundamenta Informaticae (Search for Journal in Brave)

zbMATH Keywords

coordinationserviceschoreographytransactionstrue concurrencytransaction languagescompensation semanticsequivalent execution historiesforward recoveryonline resources

Mathematics Subject Classification ID

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

Recommendations

• Communicating Sequential Processes. The First 25 Years
• A calculus for long-running transactions.
• Design and verification of long-running transactions in a timed framework
• Recovery within long-running transactions
• \textsf{cJoin}: \textsf{Join} with communicating transactions

This page was built for publication: True concurrency in long-running transactions for digital ecosystems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2804190)