In a recent work we proposed an algorithm for reachability analysis in distributed systems modeled as networks of automata. The main interest of this algorithm is that it performs its analysis in a lazy way: decision is done by only taking into account the automata potentially involved in a path to the reachability goal. This new work extends the approach to networks of timed automata, lazily considering the au-tomata but also lazily adding the clocks to the analysis, which implies not only to consider clocks tested along the paths to the goal, but also to deal with the special issues due to urgency and shared clocks. We have implemented our approach as a tool and provide some interesting experimental results, in a comparison with the model-checker Uppaal.