Folk theorems on the determinization and minimization of timed automata
From MaRDI portal
Publication:845728
DOI10.1016/j.ipl.2006.04.015zbMath1185.68401MaRDI QIDQ845728
Publication date: 29 January 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2006.04.015
68Q45: Formal languages and automata
Related Items
Formal language properties of hybrid systems with strong resets, A survey of timed automata for the development of real-time systems, Compositional schedulability analysis of real-time actor-based systems, Bounded determinization of timed automata with silent transitions, A game approach to determinize timed automata, Predictive runtime enforcement, Bounded Determinization of Timed Automata with Silent Transitions, Off-Line Test Selection with Test Purposes for Non-deterministic Timed Automata, Timed Automata with Integer Resets: Language Inclusion and Expressiveness
Cites Work