Synchronous distribution of SIGNAL programs

Abstract

SIGNAL, a synchronous and data-flow oriented language, allows the user to design safe real-time applications. Its compiler uses a single formalism called "synchronized data-flow graphs" (SDFGs) all along the conception chain from specification to proof and verification. We show how this formalism can be kept on until distributed code generation. The described implementation, called synchronous distribution, respects the semantics of SIGNAL. We finally show the limits of SDFGs and conclude with a discussion on the necessity of another model describing dynamic behaviours of distributed executions.