Sur la répartition de programmes synchrones

Abstract

Synchronous programming has been introduced to facilitate the design and programming of reactive systems (systems that react continuously to their environment, the latter being unable to synchronize itself with the system). These systems are very often distributed, be it for reasons of physical implementation, performance enhancement or fault tolerance. Besides, the works on synchronous language compilation have led to represent programs by means of finite state automata: this is the OC format.

Thus this work deals with the automatic distribution of OC programs. The main difficulty is to ensure the functional and temporal equivalence between the initial centralized program and the distributed program, as well as to prove formally this equivalence. We also take pains to minimize locally the control structure of each distributed program. In order to achieve this, we design an original "on the fly" test reduction algorithm, using bisimulation techniques.

On the other hand, we completely define the execution environment of distributed programs. Our main concern here is to achieve the most faithful solution to the centralized execution.

Finally, so as to explain the desynchronizations due to the distribution, we propose an original semantics of the synchronous language Lustre, semantics which is defined by partial orders.

BibTeX entry

@PhdThesis{Gir94,
  author = 	 {A. Girault},
  title = 	 {Sur la R\'epartition de Programmes Synchrones},
  school = 	 {INPG},
  year = 	 {1994},
  address =	 {Grenoble, France},
  type =	 {PhD Thesis},
  month =	 {January}
}