Transaction Scripts: Making Implicit Scenarios Explicit | Zendy

Sotiris Moschoyiannis | Zendy; Amir Reza Razavi | Zendy; Paul Krause | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Transaction Scripts: Making Implicit Scenarios Explicit

Author(s) -

Sotiris Moschoyiannis,

Amir Reza Razavi,

Paul Krause

Publication year - 2010

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2010.06.005

Subject(s) - computer science , scripting language , database transaction , tuple , set (abstract data type) , theoretical computer science , programming language , order (exchange) , mathematics , discrete mathematics , finance , economics

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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research