Existing models for real-time system are not able to create new process at runtime dynamically. This paper proposes a new model named asynchronous multi-process timed automata based on timed automata. Each process is abstracted as a process timed automata, and new process is triggered by parts of the states. Consider that queuing can make the model Turing complete, processes are buffered in a set. However the model is still powerful enough to model many real-time systems. The paper proves that model's coverability is decidable by encoding it to read-arc timed petri net.