Distributing Automata for Asynchronous Networks of Processors

Benoit Caillaud 1 Paul Caspi 2 Alain Girault 2 Claude Jard 1
1 PAMPA - Models and Tools for Programming Distributed Parallel Architectures
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, INRIA Rennes
Abstract : This paper addresses the problem of distributed program synthesis. In the first part, we formalize the distribution process and prove its correctness, i.e. that the initial centralized program's behavior is equivalent to the corresponding distributed's one. In order to achieve that, we first represent the program by a finite transition system, labeled by the program's actions. Then we derive an independence relation over the actions from the control and data dependencies. This leads to represent the program by an order-automaton, whose transitions are labeled partial orders coding for an action and its dependencies with other actions. In the second part, we show how such an order-automaton can be practically used to derive a distributed program.
Type de document :
[Research Report] RR-2341, INRIA. 1994
Liste complète des métadonnées

Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 15:05:37
Dernière modification le : vendredi 16 novembre 2018 - 01:28:08
Document(s) archivé(s) le : mardi 12 avril 2011 - 16:37:34



  • HAL Id : inria-00074336, version 1


Benoit Caillaud, Paul Caspi, Alain Girault, Claude Jard. Distributing Automata for Asynchronous Networks of Processors. [Research Report] RR-2341, INRIA. 1994. 〈inria-00074336〉



Consultations de la notice


Téléchargements de fichiers