Minimum and maximum delay problems in real-time systems
Formal Methods in System Design - Special issue on computer-aided verification: special methods I
Theoretical Computer Science
Symbolic model checking for real-time systems
Information and Computation
Information Processing Letters
Event-clock automata: a determinizable class of timed automata
Theoretical Computer Science
Characterization of the expressive power of silent transitions in timed automata
Fundamenta Informaticae
The Expressive Power of Clocks
ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
Minimization of Timed Transition Systems
CONCUR '92 Proceedings of the Third International Conference on 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
HSCC '98 Proceedings of the First International Workshop on Hybrid Systems: Computation and Control
A Kleene theorem for timed automata
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Back to the future: towards a theory of timed regular languages
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
Real-Time Automata and the Kleene Algebra of Sets of Real Numbers
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
An Algebraic Characterization of Data and Timed Languages
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
A Complete Axiomatisation for Timed Automata
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
Kleene Theorems for Event-Clock Automata
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
CONCUR 2005 - Concurrency Theory
Layered composition for timed automata
FORMATS'10 Proceedings of the 8th international conference on Formal modeling and analysis of timed systems
A Kleene-Schützenberger theorem for weighted timed automata
Theoretical Computer Science
| Hi-index | 0.00 |
We propose in this paper a decomposition theorem for the timed automata introduced by Alur and Dill [2]. To this purpose, we define a new simple and natural concatenation operation, indexed by the set of clocks to be reset, on timed automata generalizing the classical untimed concatenation. Then we extend the famous Kleene's and Büchi's theorems on classical untimed automata by simply changing the basic objects to take time into account, keeping the union operation and replacing the concatenation, finite and infinite iterations by the new timed concatenations and their induced iterations. Thus, and up to our knowledge, our result provides the simplest known algebraic characterization of recognizable timed languages.