In this talk I will present a component algebra and an associated logic for heterogenous timed systems. The components of the algebra are asynchronous networks of processes that abstract the behaviour of machines that execute according to the clock granularity of the network node in which they are placed and communicate asynchronously with machines at other nodes. The main novelty of this theory is that not all network nodes need to have the same clock granularity. I will discuss conditions under which it can be guaranteed, a priori, that any interconnections generated at run time through dynamic binding of machines with different clock granularities leads to a consistent orchestration of the whole system. I will provide an automata-theoretic view of these results and discuss which logics can support specifications for this component algebra.

This is joint work with J. L. Fiadeiro,  B. Delahaye and A. Legay.