Communication and concurrency
Automata for modeling real-time systems
Proceedings of the seventeenth international colloquium on Automata, languages and programming
Parametric real-time reasoning
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Theoretical Computer Science
Characterization of the expressive power of silent transitions in timed automata
Fundamenta Informaticae
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
The Observational Power of Clocks
CONCUR '94 Proceedings of the Concurrency Theory
Specifying Timed State Sequences in Powerful Decidable Logics and Timed Automata
ProCoS Proceedings of the Third International Symposium Organized Jointly with the Working Group Provably Correct Systems on Formal Techniques in Real-Time and Fault-Tolerant Systems
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Modelisation of Timed Automata in Coq
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
Widening the Boundary between Decidable and Undecidable Hybrid Systems
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Removing All Silent Transitions from Timed Automata
FORMATS '09 Proceedings of the 7th International Conference on Formal Modeling and Analysis of Timed Systems
Automata-Theoretic performance analysis method of soft real-time systems
EUC'05 Proceedings of the 2005 international conference on Embedded and Ubiquitous Computing
Low dimensional hybrid systems - decidable, undecidable, don't know
Information and Computation
| Hi-index | 0.00 |
Since their introduction by Alur and Dill, timed automata have been one of the most widely studied models for real-time systems. The syntactic extension of so-called updatable timed automata allows more powerful updates of clocks than the reset operation proposed in the original model. We prove that any language accepted by an updatable timed automaton (from classes where emptiness is decidable) is also accepted by a "classical" timed automaton. We propose even more precise results on bisimilarity between updatable and classical timed automata.