HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

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.
Document type :
Complete list of metadata

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Wednesday, May 24, 2006 - 3:05:37 PM
Last modification on : Friday, February 4, 2022 - 3:25:02 AM
Long-term archiving on: : Tuesday, April 12, 2011 - 4:37:34 PM


  • 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⟩



Record views


Files downloads