True Concurrency in Long-running Transactions for Digital Ecosystems
- Submitting institution
-
The University of Surrey
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 9006188_1
- Type
- D - Journal article
- DOI
-
10.3233/FI-2015-1222
- Title of journal
- Fundamenta Informaticae
- Article number
- -
- First page
- 483
- Volume
- 138
- Issue
- 4
- ISSN
- 0169-2968
- Open access status
- Out of scope for open access requirements
- Month of publication
- -
- Year of publication
- 2015
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
-
- Research group(s)
-
-
- Citation count
- 6
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This paper is the first to propose a true concurrency semantics for recoverable transactions involving a series of service executions. It is a significant development because it enables a more precise and less costly compensation to undo the effects of actions than was previously possible with interleaving semantics, where all possibilities needed to be compensated. This approach now features in the OMG standard BPMN (https://www.omg.org/spec/BPMN ) for service orchestration, which succeeded previous standardisation efforts, e.g., BPEL4WS and OASIS BTP standards. It has also been applied in the JXTA implementation of the FlyPeer project, with application to e-learning platforms, e.g., https://link.springer.com/chapter/10.1007/978-3-642-14859-0_17
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -