Implementation of Turing Machines with the Scufl Data-Flow Language

Authors:
Tristan Glatard;Johan Montagnat
Affiliations:
-;-
Venue:
CCGRID '08 Proceedings of the 2008 Eighth IEEE International Symposium on Cluster Computing and the Grid
Year:
2008

Citing 0
Cited 3

Towards a Formal Semantics for the Process Model of the Taverna Workbench. Part I

Fundamenta Informaticae
Three fundamental dimensions of scientific workflow interoperability: Model of computation, language, and execution environment

Future Generation Computer Systems
Towards a Formal Semantics for the Process Model of the Taverna Workbench. Part I

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, the expressiveness of the simple Scufl data-flow language is studied by showing how it can be used to implement Turing machines. To do that, several non trivial Scufl patterns such as self-looping or sub-workflows are required and we precisely explicit them. The main result of this work is to show how a complex workflow can be implemented using a very simple data-flow language. Beyond that, it shows that Scufl is a Turing complete language, given some restrictions that we discuss.