Timed automata and recognizability

DOI10.1016/S0020-0190(97)00217-2zbMATH Open0925.68275MaRDI QIDQ1129268FDOQ1129268

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

• A theory of timed automata
• Removing ε-transitions in timed automata
• Timed automata and recognizability
• Title not available (Why is that?)

Cited In (5)

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

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)