Revisiting reachability in timed automata - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2017

Revisiting reachability in timed automata

Dates et versions

hal-02411539 , version 1 (14-12-2019)

Identifiants

Citer

Karin Quaas, Mahsa Shirmohammadi, James Worrell. Revisiting reachability in timed automata. 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), Jun 2017, Reykjavik, France. pp.1-12, ⟨10.1109/LICS.2017.8005098⟩. ⟨hal-02411539⟩
28 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More