Comparing models of computation
Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design
Workflow and Process Synchronization with Interaction Expressions and Graphs
Proceedings of the 17th International Conference on Data Engineering
An Event Algebra for Specifying and Scheduling Workflows
Proceedings of the 4th International Conference on Database Systems for Advanced Applications (DASFAA)
A brief history of process algebra
Theoretical Computer Science - Process algebra
Scientific workflow management and the Kepler system: Research Articles
Concurrency and Computation: Practice & Experience - Workflow in Grid Systems
Taverna Workflows: Syntax and Semantics
E-SCIENCE '07 Proceedings of the Third IEEE International Conference on e-Science and Grid Computing
Hi-index | 0.00 |
In this paper we propose a calculus that can be used to describe the semantics of collection-oriented scientific workflow systems such as the Taverna workbench. Typically such systems focus on the specification and execution of workflows with a relatively simple control flow and a more complex data flow that involves large nested collections of data. An essential operation in such workflows is the instantiation of a certain nested workflow for each element of a collection. We argue that if such workflows call external services, their semantics must be described not only in terms of input-output behavior but also take side effects into account. Based on this assumption a trace semantics is defined that corresponds to the observational equivalence of two workflow specifications. We show that under such a semantics a relatively small calculus with a structural semantics can be defined and used to describe such workflows. This is demonstrated by giving a translation of Taverna workflows in terms of this calculus.