Undecidability Results for Timed Automata with Silent Transitions

DOI10.3233/FI-2009-0063zbMath1176.68099OpenAlexW1853568628MaRDI QIDQ3635988

Serge Haddad, Pierre-Alain Reynier, Patricia Bouyer

Publication date: 30 June 2009

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2009-0063

zbMATH Keywords

timed automatadecidabilitysilent transitions

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (8)

Model Checking Real-Time Systems ⋮ Equivalence checking and intersection of deterministic timed finite state machines ⋮ Timed Automata with Integer Resets: Language Inclusion and Expressiveness ⋮ A menagerie of timed automata ⋮ Formal language properties of hybrid systems with strong resets ⋮ Determinization and Expressiveness of Integer Reset Timed Automata with Silent Transitions ⋮ An Introduction to Timed Automata ⋮ Removing All Silent Transitions from Timed Automata

This page was built for publication: Undecidability Results for Timed Automata with Silent Transitions