In the paper [10] the unfolding technique was applied to coloured Petri nets (CPN) [8,9]. It was also shown in [10] how to use the unfolding technique taking into consideration symmetry or equivalence specifications. In [1] unfolding technique was applied to interval-timed Petri nets. This paper transfers this technique to interval-timed CPN and also considers the unfolding technique for timed CPN (TCPN) [8,9]. We require CPN to be finite, n-safe and containing only finite sets of colours.