The Semantics and Execution of a Synchronous Block-Diagram Language

Stephen A. Edwards and Edward A. Lee

EECS Department
University of California, Berkeley
Technical Report No. UCB/ERL M01/33
October 2001

http://www2.eecs.berkeley.edu/Pubs/TechRpts/2001/ERL-01-33.pdf

We present a new block diagram language for describing synchronous software. It coordinates the execution of synchronous, concurrent software modules, allowing real-time systems to be assembled from precompiled blocks specified in other languages. The semantics we present, based on fixed points, is deterministic even in the presence of instantaneous feedback. The execution policy develops a static a fixed order in which to execute the blocks that makes the system execution predictable.

We present exact and heuristic algorithms for finding schedules that minimize system execution time, and show that good schedules can be found quickly. The scheduling algorithms are applicable to other problems where large systems of equations need to be solved.

BibTeX citation:

@techreport{Edwards:M01/33,
    Author = {Edwards, Stephen A. and Lee, Edward A.},
    Title = {The Semantics and Execution of a Synchronous Block-Diagram Language},
    Institution = {EECS Department, University of California, Berkeley},
    Year = {2001},
    Month = {Oct},
    URL = {http://www2.eecs.berkeley.edu/Pubs/TechRpts/2001/9593.html},
    Number = {UCB/ERL M01/33},
    Abstract = {We present a new block diagram language for describing synchronous software. It coordinates the execution of synchronous, concurrent software modules, allowing real-time systems to be assembled from precompiled blocks specified in other languages. The semantics we present, based on fixed points, is deterministic even in the presence of instantaneous feedback. The execution policy develops a static a fixed order in which to execute the blocks that makes the system execution predictable.

We present exact and heuristic algorithms for finding schedules that minimize system execution time, and show that good schedules can be found quickly. The scheduling algorithms are applicable to other problems where large systems of equations need to be solved.}
}

EndNote citation:

%0 Report
%A Edwards, Stephen A.
%A Lee, Edward A.
%T The Semantics and Execution of a Synchronous Block-Diagram Language
%I EECS Department, University of California, Berkeley
%D 2001
%@ UCB/ERL M01/33
%U http://www2.eecs.berkeley.edu/Pubs/TechRpts/2001/9593.html
%F Edwards:M01/33