Timed automata and additive clock constraints

DOI10.1016/S0020-0190(00)00075-2zbMath0953.68565OpenAlexW2039039881MaRDI QIDQ1583056

Béatrice Bérard, Catherine Dufourd

Publication date: 26 October 2000

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(00)00075-2

zbMATH Keywords

real-time systemstimed automatadecidability of emptiness

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items

Updatable timed automata, Model Checking Real-Time Systems, A survey of timed automata for the development of real-time systems, Updatable Timed Automata with Additive and Diagonal Constraints, Low dimensional hybrid systems -- decidable, undecidable, don't know, Model checking weighted integer reset timed automata, A decidable class of planar linear hybrid systems, A menagerie of timed automata, Dynamic data structures for timed automata acceptance

Cites Work

• Untiming timed languages
• A theory of timed automata
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item