Finite automata on timed ω-trees

✍ Scribed by Salvatore La Torre; Margherita Napoli

• Publisher: Elsevier Science
• Year: 2003
• Tongue: English
• Weight: 264 KB
• Volume: 293
• Category: Article
• ISSN: 0304-3975
• DOI: 10.1016/s0304-3975(02)00611-4

✦ Synopsis

In the last decade Alur and Dill introduced a model of automata on timed !-sequences which extends the traditional models of ÿnite automata. In this paper, we present a theory of timed !-trees which extends both the theory of timed !-sequences and the theory of !-trees. The main motivation is to introduce a new way of specifying real-time systems and provide tools for studying decidability problems in related ÿelds. We focus on the decision problems and their applications in system veriÿcation and synthesis.