Theoretical Computer Science
Time-abstracted bisimulation: implicit specifications and decidability
Information and Computation
Dynamical Properties of Timed Automata
Discrete Event Dynamic Systems
Computing Reachability Relations in Timed Automata
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
On Discretization of Delays in Timed Automata and Digital Circuits
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Data-Structures for the Verification of Timed Automata
HART '97 Proceedings of the International Workshop on Hybrid and Real-Time Systems
Undecidable problems in unreliable computations
Theoretical Computer Science - Latin American theoretical informatics
Revisiting Digitization, Robustness, and Decidability for Timed Automata
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
On the Language Inclusion Problem for Timed Automata: Closing a Decidability Gap
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Universality and language inclusion for open and closed timed automata
HSCC'03 Proceedings of the 6th international conference on Hybrid systems: computation and control
Decidability and complexity results for timed automata via channel machines
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
On sampled semantics of timed systems
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Universality of R-automata with Value Copying
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
Timed automata can be studied in not only a dense-time setting but also a discrete-time setting. The most common example of discrete-time semantics is the so called sampled semantics (i.e., discrete semantics with a fixed time granularity Ɛ). In the real-time setting, the universality problem is known to be undecidable for timed automata. In this work, we study the universality question for the languages accepted by timed automata with sampled semantics. On the negative side, we show that deciding whether for all sampling periods Ɛ a timed automaton accepts all timed words in Ɛ-sampled semantics is as hard as in the real-time case, i.e., undecidable. On the positive side, we show that checking whether there is a sampling period such that a timed automaton accepts all untimed words in Ɛ-sampled semantics is decidable. Our proof uses clock difference relations, developed to characterize the reachability relation for timed automata in connection with sampled semantics.