Finite automata on timed \(\omega\)-trees

DOI10.1016/S0304-3975(02)00611-4zbMath1032.68095OpenAlexW2068192624MaRDI QIDQ1395427

Margherita Napoli, Salvatore La Torre

Publication date: 1 July 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(02)00611-4

zbMATH Keywords

\(\omega\)-treestimed \(\omega\)-trees

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Automata-theoretic decision of timed games ⋮ Parametric metric interval temporal logic ⋮ Weak Muller acceptance conditions for tree automata

Cites Work

• Model-checking in dense real-time
• Infinite games played on finite graphs
• A theory of timed automata
• Timed tree automata with an application to temporal logic.
• Discrete-time control for rectangular hybrid automata
• Proving Liveness Properties of Concurrent Programs
• On the synthesis of strategies in infinite games
• Solving Sequential Conditions by Finite-State Strategies
• Testing and generating infinite sequences by a finite automaton
• Decidability of Second-Order Theories and Automata on Infinite Trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item