Transaction Scripts: Making Implicit Scenarios Explicit
Moschoyiannis, S, Razavi, A and Krause, P (2010) Transaction Scripts: Making Implicit Scenarios Explicit Electronic Notes in Theoretical Computer Science, 238 (6). pp. 63-79.
Available under License : See the attached licence file.
We describe a true-concurrent approach for managing dependencies between distributed and concurrent coordinator components of a long-running transaction. In previous work we have described how interactions specified in a scenario can be translated into a tuples-based behavioural description, namely vector languages. In this paper we show how reasoning against order-theoretic properties of such languages can reveal missing behaviours which are not explicitly described in the scenario but are still possible. Our approach supports the gradual refinement of scenarios of interaction into a complete set of behaviours that includes all desirable orderings of execution and prohibits emergent behaviour of the transaction. Crown Copyright © 2010.
|Divisions :||Faculty of Engineering and Physical Sciences > Computing Science|
|Identification Number :||10.1016/j.entcs.2010.06.005|
|Additional Information :||NOTICE: this is the author’s version of a work that was accepted for publication in Electronic Notes in Theoretical Computer Science. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Electronic Notes in Theoretical Computer Science, 238(6), 2010, DOI 10.1016/j.entcs.2010.06.005.|
|Depositing User :||Symplectic Elements|
|Date Deposited :||12 Feb 2013 11:46|
|Last Modified :||23 Sep 2013 19:53|
Actions (login required)
Downloads per month over past year