We present a component algebra for services that can guar-
antee time-related properties. The components of this algebra are net-
works of processes that execute according to time constraints and com-
municate asynchronously through channels that can delay messages. We
characterise a sub-class of consistent networks give sucient conditions
for that class to be closed under composition. Finally, we show how those
conditions can be checked, at design time, over timed I/O automata as
orchestrations of services, thus ensuring that, when binding a client with
a supplier service at run time, the orchestrations of the two services can
work together as interconnected without further checks.