A Class of Automata for Computing Reachability Relations in Timed Systems

Abstract : no abstract
Type de document :
Communication dans un congrès
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, 2005
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01699962
Contributeur : Catalin Dima <>
Soumis le : vendredi 2 février 2018 - 22:52:55
Dernière modification le : samedi 3 février 2018 - 01:11:57

Identifiants

  • HAL Id : hal-01699962, version 1

Collections

Citation

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, 2005. 〈hal-01699962〉

Partager

Métriques

Consultations de la notice

15