Recently we proposed a mathematical framework offering diverse models of computation and a formal foundation for correct-byconstruction deployment of synchronous designs over distributed architecture (such as GALS or LTTA). In this paper, we extend our framework to model explicitly causality relations and scheduling constraints. We show how the formal results on the preservation of semantics hold also for these cases and we discuss the overall contribution in the context of previous work on desynchronization.
Albert Benveniste, Benoît Caillaud, Luca P.