In this paper, we study the concurrent behaviors of timers with arbitrary delays. Timers are modeled as synchronized products of automata, and we investigate formal languages satisfying constraints on the delays of each timer. Under very general assumptions, we prove that the concurrent behavior of two timers is rational. We give explicit automata to recognize these languages, which can be used as models in the specification and verification of timed processes.
