We propose a typing theory, based on multiparty session types, for modular
verification of real-time choreographic interactions. To model real-time implementations,
we introduce a simple calculus with delays and a decidable static proof system.
The proof system with time constraints ensures type safety and time-error freedom,
namely processes respect the prescribed timing and causalities between interactions. A
decidable condition, enforceable on timed global types, guarantees global time-progress
for validated processes with delays, and gives a sound and complete characterisation of
a new class of CTAs with general topologies that enjoys global progress and liveness.