Esterel

For other uses, see Esterel (disambiguation).
Esterel
ParadigmsImperative, synchronous
Designed byGérard Berry
DeveloperInria
First appeared1980s
Websitewww.esterel.org

Esterel is a synchronous programming language for the development of complex reactive systems. The imperative programming style of Esterel allows the simple expression of parallelism and preemption. As a consequence, it is well suited for control-dominated model designs.

The development of the language started in the early 1980s, and was mainly carried out by a team of Ecole des Mines de Paris and INRIA led by Gérard Berry in France. Current compilers take Esterel programs and generate C code or hardware (RTL) implementations (VHDL or Verilog).

The language is still under development, with several compilers out. The commercial development environment of Esterel is Esterel Studio. The company that commercialized it (Synfora) initiated a normalization process with the IEEE in April 2007 however the working group (P1778) dissolved March 2011. The reference manual is publicly available.[1]

A provisional version of Esterel has been implemented in Racket.[2]

The multiform notion of time

The notion of time used in Esterel differs from that of non-synchronous languages in the following way: The notion of physical time is replaced with the notion of order. Only the simultaneity and precedence of events are considered. This means that the physical time does not play any special role. This is called multiform notion of time. An Esterel program describes a totally ordered sequence of logical instants. At each instant, an arbitrary number of events occur (including 0). Event occurrences that happen at the same logical instant are considered simultaneous. Other events are ordered as their instances of occurrences. There are two types of statements: Those that take zero time (execute and terminate in the same instant) and those that delay for a prescribed number of cycles.

Signals

Signals are the only means of communication. There are valued and non-valued signals. They are further categorized as being input, output, or local signals. A signal has the property of being either present or absent in an instant. Valued signals also contain a value. Signals are broadcast across the program, and that means any process can read or write a signal. The value of a valued signal can be determined in any instant, even if the signal is absent. The default status of a signal is absent. Signals remain absent until they are explicitly set to present using the emit statement. Communication is instantaneous, that means that a signal emitted in a cycle is visible immediately. Note that one can communicate back and forth in the same cycle.

Signal coherence rules

  • Each signal is only present or absent in a cycle, never both.
  • All writers run before any readers do.

Thus 

present A else
    emit A
end

is an erroneous program, since the writer "emit A" should run before the reader "present A", whereas this program requires "present A" to be performed first.

The language statements

Primitive Esterel statements

Pure Esterel has eleven primitive statements.[3]

nothing Terminates immediately with no other effect.
pause Blocks control flow in the current cycle for resumption in the next cycle.
p ; q Runs p until it terminates and then, in the same reaction, starts q.
p || q Runs p and q in parallel
loop p end Restarts the body p as soon as it terminates. Every path through the loop body must contain at least one pause statement to avoid unbounded looping within a single reaction.
signal S in p end Declares a local signal.
emit S Make signal S present in the current instant. A signal is absent unless it is emitted.
present S then p else q end If signal S is present in the current instant, immediately run p, otherwise run q.
suspend p when S Suspends the execution of the body in instants where S is present.
trap T in p end Declare a labeled escape block.
exit T Jump to the end of the innermost T-labeled escape block.

Derived Esterel statements

Esterel has several derived constructions:[4][5]

Derived statement Expansion
halt loop pause end
sustain s loop emit s; pause end
present s then p end present s then p else nothing end
await s trap T in loop pause; present s then exit T end end loop end
await immediate s trap T in loop present s then exit T end; pause end loop end
suspend p when immediate s suspend present s then pause end; p when s
abort p when (immediate) s trap T in suspend p when (immediate) s; exit T || await (immediate) s; exit T; end
weak abort p when (immediate) s trap T in p; exit T || await (immediate) s; exit T; end
loop p each s loop abort p ; halt when s end loop
every (immediate) s do p end every await (immediate) s; loop p each s

Other Esterel statements

The full Esterel language also has statements for declaring and instantiating modules, for variables, for calling external procedures, and for valued signals.

Example (ABRO)

The following program emits the output O as soon as both inputs A and B have been received. Reset the behaviour whenever the input R is received. 

module ABRO:
input A, B, R;
output O;

loop
  [ await A || await B ];
  emit O
each R

end module

Advantages of Esterel

  • Model of time gives programmer precise control
  • Concurrency convenient for specifying control systems
  • Completely deterministic
  • Finite-state language
    • Execution time predictable
    • Much easier to verify formally
  • Can be implemented in hardware as well as in software

Disadvantages of Esterel

  • Finite-state nature of the language limits flexibility (but expressivity is sufficient for the chosen application field)
  • Semantic challenges
    • Avoiding causality violations is often difficult
    • Difficult to compile in the general case, but simple correctness criteria exist

See also

References

  1. ^ Lefebvre, J. (November 3, 2005). "Esterel v7 Reference Manual Version v7 30 – initial IEEE standardization proposal" (PDF). Esterel Technologies. Archived from the original (PDF) on December 30, 2005.
  2. ^ "Esterel in Racket". docs.racket-lang.org.
  3. ^ Berry, Gérard (1999). "The Constructive Semantics of Pure Esterel". CiteSeerX 10.1.1.46.2076.
  4. ^ Berry, Gérard (June 2000). "The Esterel v5 Language Primer". Ecole des Mines and INRIA. CiteSeerX 10.1.1.3.1177.
  5. ^ Berry, Gérard; Gonthier, Georges (November 1992). "The Esterel synchronous programming language: Design, semantics, implementation". Science of Computer Programming. 19 (2): 87–152. CiteSeerX 10.1.1.17.5606. doi:10.1016/0167-6423(92)90005-V.