A Class of Automata for Computing Reachability Relations in Timed Systems
Résumé
no abstract
Communication Dans Un Congrès
Année : 2005
Catalin Dima : Connectez-vous pour contacter le contributeur
https://hal.science/hal-01699962
Soumis le : vendredi 2 février 2018-22:52:55
Dernière modification le : vendredi 24 mars 2023-14:53:06
Dates et versions
Identifiants
- HAL Id : hal-01699962 , version 1
Citer
Catalin Dima. A Class of Automata for Computing Reachability Relations in Timed Systems. Verification of Infinite-State Systems with Applications to Security, Proceedings of the NATO Advanced Research Workshop "Verification of Infinite State Systems with Applications to Security VISSAS 2005", Timisoara, Romania, March 17-22, 2005, 2005, Unknown, Unknown Region. pp.69--89. ⟨hal-01699962⟩
24
Consultations
0
Téléchargements