Catalin Dima. Computing Reachability Relations in Timed Automata.
17th IEEE Symposium on Logic in Computer Science (LICS 2002), 22-25 July 2002, Copenhagen, Denmark, Proceedings, 2002, Unknown, Unknown Region. pp.177,
⟨10.1109/LICS.2002.1029827⟩.
⟨hal-01699968⟩ 
