A Compositional Translation of Timed Automata with Deadlines to Uppaal Timed Automata

Timed Automata with Deadlines (TAD) are a form of timed automata that admit a more natural representation of urgent actions, with the additional advantage of avoiding the most common form of timelocks. We offer a compositional translation of a practically useful subset of TAD to timed safety automata (the well-known variant of timed automata where time progress conditions are expressed by invariants). More precisely, we translate networks of TAD to the modeling language of UPPAAL, a state-of-the-art verification tool for timed automata. We also describe an implementation of this translation, which allows UPPAAL to aid the design and analysis of TAD models.