Skip to main content


Compilation and Worst-Case Reaction Time Analysis for Multithreaded Esterel Processing

Article metrics

  • 975 Accesses

  • 7 Citations


The recently proposed reactive processing architectures are characterized by instruction set architectures (ISAs) that directly support reactive control fow including concurrency and preemption. These architectures provide efficient execution platforms for reactive synchronous programs; however, they do require novel compiler technologies, notably with respect to the handling of concurrency. Another key quality of the reactive architectures is that they have very predictable timing properties, which make it feasible to analyze their worst-case reaction time (WCRT). We present an approach to compile programs written in the synchronous language Esterel onto a reactive processing architecture that handles concurrency via priority-based multithreading. Building on this compilation approach, we also present a procedure for statically determining tight, safe upper bounds on the WCRT. Experimental results indicate the practicality of this approach, with WCRT estimates to be accurate within 22% on average.

Publisher note

To access the full article, please see PDF.

Author information

Correspondence to Claus Traulsen.

Rights and permissions

Reprints and Permissions

About this article


  • Time Analysis
  • Control Structure
  • Reactive Control
  • Timing Property
  • Electronic Circuit