Distributing automata for asynchronous networks of processors (1997)

Content Provider	CiteSeerX
Author	Caillaud, Benoît Caspi, Paul Girault, Alain Jard, Claude
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 derivea distributed program.
File Format	PDF
Volume Number	31
Journal	EUROPEAN JOURNAL ON AUTOMATED SYSTEMS
Language	English
Publisher Date	1997-01-01
Access Restriction	Open
Subject Keyword	Asynchronous Network Second Part First Part Distribution Process Distributed Program Synthesis Partial Order Independence Relation Finite Transition System Distributed Program Data Dependency Initial Centralized Program
Content Type	Text
Resource Type	Article