Bounded Determinization of Timed Automata with Silent Transitions

DOI10.1007/978-3-319-22975-1_19zbMath1465.68161OpenAlexW2764294725MaRDI QIDQ2945604

Dejan Ničković, Amnon Rosenmann, Florian Lorber, Bernhard K. Aichernig

Publication date: 14 September 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: http://openlib.tugraz.at/5bffb48d5954d

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

Bounded Determinization of Timed Automata with Silent Transitions ⋮ Bounded determinization of timed automata with silent transitions

Cites Work

• Unnamed Item
• Conformance testing for real-time systems
• Folk theorems on the determinization and minimization of timed automata
• A theory of timed automata
• Uppaal in a nutshell
• Bounded Determinization of Timed Automata with Silent Transitions
• A Game Approach to Determinize Timed Automata
• Off-Line Test Selection with Test Purposes for Non-deterministic Timed Automata
• Undecidable Problems About Timed Automata
• When Are Timed Automata Determinizable?
• Removing ε-transitions in timed automata
• Formal Modeling and Analysis of Timed Systems

This page was built for publication: Bounded Determinization of Timed Automata with Silent Transitions