Implementation of Turing machines with the Scufl data-flow language

Tristan Glatard 1, 2 Johan Montagnat 1
1 Laboratoire d'Informatique, Signaux, et Systèmes de Sophia-Antipolis (I3S) / Equipe RAINBOW
SPARKS - Scalable and Pervasive softwARe and Knowledge Systems
2 ASCLEPIOS - Analysis and Simulation of Biomedical Images
CRISAM - Inria Sophia Antipolis - Méditerranée
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.
Type de document :
Communication dans un congrès
Workshop on Workflow Systems in e-Science, May 2008, Lyon, France. pp.1-10, 2008
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-00683113
Contributeur : Johan Montagnat <>
Soumis le : mardi 27 mars 2012 - 17:36:38
Dernière modification le : lundi 5 octobre 2015 - 16:57:42
Document(s) archivé(s) le : lundi 26 novembre 2012 - 12:21:29

Fichier

wses08.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00683113, version 1

Collections

Citation

Tristan Glatard, Johan Montagnat. Implementation of Turing machines with the Scufl data-flow language. Workshop on Workflow Systems in e-Science, May 2008, Lyon, France. pp.1-10, 2008. <hal-00683113>

Partager

Métriques

Consultations de
la notice

226

Téléchargements du document

112