Hierarchical Timing Language

Arkadeb Ghosal, Thomas A. Henzinger, Daniel Iercan, Christoph Kirsch and Alberto L. Sangiovanni-Vincentelli

EECS Department
University of California, Berkeley
Technical Report No. UCB/EECS-2006-79
May 23, 2006

http://www2.eecs.berkeley.edu/Pubs/TechRpts/2006/EECS-2006-79.pdf

We have designed and implemented a new programming language for hard real-time systems. Critical timing constraints are specified within the language, and ensured by the compiler. The main novel feature of the language is that programs are extensible in two dimensions without changing their timing behavior: new program modules can be added, and individual program task can be refined. The mechanism that supports time invariance under parallel composition is that different program modules communicate at specified instances of time. Time invariance under refinement is achieved by conservative scheduling of the top level. The language, which assembles real-time tasks within a hierarchical module structure with timing constraints, is called Hierarchical Timing Language (HTL). It is a coordination language, in that individual tasks can be implemented in other languages. We present a distributed HTL implementation of an automotive steer-by-wire controller as a case study.


BibTeX citation:

@techreport{Ghosal:EECS-2006-79,
    Author = {Ghosal, Arkadeb and Henzinger, Thomas A. and Iercan, Daniel and Kirsch, Christoph and Sangiovanni-Vincentelli, Alberto L.},
    Title = {Hierarchical Timing Language},
    Institution = {EECS Department, University of California, Berkeley},
    Year = {2006},
    Month = {May},
    URL = {http://www2.eecs.berkeley.edu/Pubs/TechRpts/2006/EECS-2006-79.html},
    Number = {UCB/EECS-2006-79},
    Abstract = {We have designed and implemented a new programming language for hard real-time systems. Critical timing constraints are specified within the language, and ensured by the compiler. The main novel feature of the language is that programs are extensible in two dimensions without changing their timing behavior: new program modules can be added, and individual program task can be refined. The mechanism that supports time invariance under parallel composition is that different program modules communicate at specified instances of time. Time invariance under refinement is achieved by conservative scheduling of the top level. The language, which assembles real-time tasks within a hierarchical module structure with timing constraints, is called Hierarchical Timing Language (HTL). It is a coordination language, in that individual tasks can be implemented in other languages. We present a distributed HTL implementation of an automotive steer-by-wire controller as a case study.}
}

EndNote citation:

%0 Report
%A Ghosal, Arkadeb
%A Henzinger, Thomas A.
%A Iercan, Daniel
%A Kirsch, Christoph
%A Sangiovanni-Vincentelli, Alberto L.
%T Hierarchical Timing Language
%I EECS Department, University of California, Berkeley
%D 2006
%8 May 23
%@ UCB/EECS-2006-79
%U http://www2.eecs.berkeley.edu/Pubs/TechRpts/2006/EECS-2006-79.html
%F Ghosal:EECS-2006-79