Please use this identifier to cite or link to this item: http://hdl.handle.net/1959.3/233941

Download PDF (Author's version) (Adobe Acrobat PDF, -1 bytes)

Title

A general model for nested transactional workflows

Author(s)

Kuo, Dean;  Lawley, Michael;  Liu, Chengfei;  Orlowska, Maria

Abstract

This paper applies concepts from transaction processing to workflows, thus enabling workflows to exhibit relaxed transactional behaviour. A general model for transactional workflows is presented. We define correctness of transactional workflows in terms of the model, and use the model to find schedules such that the execution of a transactional workflow is guaranteed to terminate in one of its acceptable termination (commit or abort) states. We allow a transactional workflow to consist of a number of tasks composed by the constructs ordering, contingency, alternative, conditional and iteration. In addition, we show how the model can be used to support proper nesting of transactional workflows to reduce the diffculty of scheduling algorithms and to provide for structured and modular TWF specification.

Publication type

Conference paper

Source

Proceedings of the International Workshop on Advanced Transaction Models and Architectures (ATMA 96), held in conjunction with the 22nd International Conference on Very Large Data Bases (VLDB 96), Goa, India, 31 August-02 September 1996, pp. 18-35

Publication year

1996

Keyword(s)

Correctness;  Failure atomicity;  Modelling;  Schedules;  Tasks;  Transactional workflows

Publisher

Department of Computer Science and Technology, Goa University

Copyright

Copyright © 1996. This work is reproduced in good faith. Every reasonable effort has been made to trace the copyright owner. For more information please contact researchbank@swin.edu.au

Full text

Peer reviewed