Skip to Main content Skip to Navigation
Conference papers

Computing Reachability Relations in Timed Automata

Catalin Dima 1
1 LACL - Laboratoire d'Algorithmique Complexité et Logique
Abstract : no abstract
Complete list of metadatas
https://hal.archives-ouvertes.fr/hal-01699968
Contributor : Catalin Dima <>
Submitted on : Friday, February 2, 2018 - 10:53:12 PM
Last modification on : Friday, October 4, 2019 - 1:12:37 AM

Identifiers

Collections

CNRS | UPEC-UPEM | LACL | UPEC

Citation

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⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

69

Contact

Informations

CCSD