Distributing Automata for Asynchronous Networks of Processors - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1994

Distributing Automata for Asynchronous Networks of Processors


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.
Fichier principal
Vignette du fichier
RR-2341.pdf (332.78 Ko) Télécharger le fichier

Dates and versions

inria-00074336 , version 1 (24-05-2006)


  • 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⟩
136 View
88 Download


Gmail Facebook Twitter LinkedIn More