Transaction Scripts: Making Implicit Scenarios Explicit

Authors:
Sotiris Moschoyiannis;Amir Razavi;Paul Krause
Affiliations:
Department of Computing, University of Surrey, Guildford, Surrey, GU2 7XH, UK;Department of Computing, University of Surrey, Guildford, Surrey, GU2 7XH, UK;Department of Computing, University of Surrey, Guildford, Surrey, GU2 7XH, UK
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2010

Citing 4
Cited 0

Introduction to General Net Theory

Proceedings of the Advanced Course on General Net Theory of Processes and Systems: Net Theory and Applications
Basic notions of trace theory

Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
Modelling concurrent interactions

Theoretical Computer Science - Algebraic methodology and software technology
Modelling Component Behaviour with Concurrent Automata

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.