Computing Reachability Relations in Timed Automata
Abstract
no abstract
Conference Papers
Year : 2002
Catalin Dima : Connect in order to contact the contributor
https://hal.science/hal-01699968
Submitted on : Friday, February 2, 2018-10:53:12 PM
Last modification on : Friday, December 27, 2024-7:54:43 PM
Cite
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⟩