Distributing Automata for Asynchronous Networks of Processors
Benoı̂t Caillaud, Programmes Et, Benoı̂t Caillaud, Paul Caspi, Paul Caspi, Alain Girault, Alain Girault, Claude Jard, Claude Jard · 1994
: 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. Key-words: theory of parallel and distributed computation, automata and formal languages (R'esum'e : tsvp) This work has been partially supported by PRC C 3 (CNRS), GRECO Automatique action C2A and Minist`ere de l'Enseignement Sup'erieur e...