The major contribution of this paper is to introduce a common semantical representation, Synchronous Automata, for integrating the synchronous languages. In a first step, we have presented the basics of Synchronous Automata. Signals and Wires . Signals are physically supported by wires and represent flows of transient information. An event refers to the current status of a set of signals.
Registers support the representation of persistent information.
A state is distributively represented over the current status of a set of registers. On the one hand, the notion of state over pure registers is mainly relevant for imperative programs. On the other hand, even if the notion of pure signal is not irrelevant for imperative programs, it is really central for declarative programs where these signals are called clocks. This property makes Synchronous Automata a semantical instance of the synchronous programming paradigm . However, synchronous languages are not only considered as programming languages but also, in some extent, as specification languages.