We present timed automata and timed Petri nets and argue that timed automata and their associated parallel composition operator are not well adapted for the compositional description of timed Petri nets. Timed automata with deadlines are presented. We present a compositional translation method from 1-safe timed Petri nets to this model. We also present basic ideas for a general compositional specification framework