Skip to Main content Skip to Navigation
Conference papers

A Class of Automata for Computing Reachability Relations in Timed Systems

Abstract : no abstract
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01699962
Contributor : Catalin Dima <>
Submitted on : Friday, February 2, 2018 - 10:52:55 PM
Last modification on : Friday, October 4, 2019 - 1:12:46 AM

Identifiers

  • 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. ⟨hal-01699962⟩

Share

Metrics

Record views

23