Clocks in dataflow languages

AbstractThis paper addresses the problem of using a dataflow language in “real-time” continuously operating systems. It shows that this raises a problem of bounded memory which can be characterized in terms of multiple input-output sequential machines, and proposes a generalization of the Ginsburg-Rose theorem in this case. Finally, it shows how these concepts have been applied in the clock calculus of the synchronous dataflow language Lustre