Timed automata and recognizability

DOI10.1016/S0020-0190(97)00217-2MaRDI QIDQ1129268zbMATH OpenFDO

Authors Philippe Herrmann

Publication date 13 August 1998

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

zbMATH Keywords

Real-time systemsFormal languagesTimed automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• scientific article; zbMATH DE number 177824 (Why is no real title available?)
• A theory of timed automata
• Removing \(\epsilon \)-transitions in timed automata
• Timed automata and recognizability

Cited in

(5)

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

This page was built for publication: Timed automata and recognizability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1129268)