Timed automata and recognizability

DOI10.1016/S0020-0190(97)00217-2zbMath0925.68275MaRDI QIDQ1129268

Philippe Herrmann

Publication date: 13 August 1998

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

zbMATH Keywords

Real-time systemsTimed automataFormal languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Model Checking Real-Time Systems, Time-Bounded Verification, Timed automata and recognizability, History-deterministic timed automata are not determinizable, Formal language properties of hybrid systems with strong resets

Cites Work

• Timed automata and recognizability
• A theory of timed automata
• Removing ε-transitions in timed automata
• Unnamed Item