Static dataflow graphs such as those presented in earlier chapters are attractive from a
performance point of view, as the rate at which data is processed can be assessed …

This article deals with the input–output representation of a class of timed discrete event
systems. The systems considered are those that can be described using timed event graphs …

Various kinds of manufacturing systems can be modeled and analyzed by Timed
EventGraphs (TEGs). These TEGs are a particular class of timed Discrete Event Systems …

Exact analysis of synchronous dataflow (sdf) graphs is often considered too costly, because
of the expensive transformation of the graph into a single-rate equivalent. As an alternative …

Abstract Synchronous DataFlow Graph (SDFG in short) is a formalism frequently considered
in electronic design and software compilers to model communications between components …

In this article, we present a mathematical characterisation of admissible schedules of cyclo-
static dataflow (csdf) graphs. We demonstrate how algebra ic manipulation of this …

Efficient analysis techniques for hsdf graphs exist; a graph's throughput and the associated
static schedule may be computed in polynomial time [Dasdan 2004]. These techniques can …

This paper presents a programming model approach that explicitly addresses the
programmability of scientific code by annotating imperative code with its algorithmic …