|NeSC Bibliographic Database|
New directions in Workflow formalisms
Appeared in: Proceedings of the UK e-Science All Hands Conference 2007 website: http://www.allhands.org.uk/2007/
Publisher: National e-Science Centre
Field of Science: e-Science
Abstract: Due to increasing complexity of scientific workflows as well as a greater number of available services new problems arise. In this paper we present an approach to these problems at multiple levels of both data communication and process abstraction. We give an overview of formalisms: Turing machines, I/O Automata, Petri Nets, Constraint Automata and p Calculus in respect of their suitability to the presented approach. On the basis of this overview we conclude that Constraint Automata best suit this approach.
Keywords: e-Science, AHM 2007
|Last Updated: 22 Jun 12 11:02|