The expressive power of clocks

DOI10.1007/3-540-60084-1_93zbMath1412.68131OpenAlexW1690546704MaRDI QIDQ4645197

Peter W. Kopke, Howard Wong-Toi, Thomas A. Henzinger

Publication date: 10 January 2019

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60084-1_93

zbMATH Keywords

regular languagefinite automatonexpressive powerlabeled transition systemacceptance condition

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

Updatable timed automata, Model Checking Real-Time Systems, An algebraic approach to data languages and timed languages, What’s Decidable About Parametric Timed Automata?, Classes of Timed Automata and the Undecidability of Universality

Cites Work

• Unnamed Item
• Unnamed Item
• Real-time logics: Complexity and expressiveness
• Sooner is safer than later
• A theory of timed automata
• Symbolic model checking for real-time systems
• Real-time system = discrete system + clock variables
• What good are digital clocks?