Folk theorems on the determinization and minimization of timed automata

DOI10.1016/j.ipl.2006.04.015zbMath1185.68401OpenAlexW2144186266MaRDI QIDQ845728

Stavros Tripakis

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

zbMATH Keywords

timed automataspecification languagesdecidabilityformal methodsdeterminization

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (11)

Predictive runtime enforcement ⋮ Bounded Determinization of Timed Automata with Silent Transitions ⋮ A survey of timed automata for the development of real-time systems ⋮ Bounded determinization of timed automata with silent transitions ⋮ Timed Automata with Integer Resets: Language Inclusion and Expressiveness ⋮ Off-Line Test Selection with Test Purposes for Non-deterministic Timed Automata ⋮ Compositional schedulability analysis of real-time actor-based systems ⋮ A game approach to determinize timed automata ⋮ Formal language properties of hybrid systems with strong resets ⋮ Unnamed Item ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimum and maximum delay problems in real-time systems
• A theory of timed automata
• Formal Modeling and Analysis of Timed Systems
• Computer Aided Verification
• Analysis of timed systems using time-abstracting bisimulations

This page was built for publication: Folk theorems on the determinization and minimization of timed automata