Bounded determinization of timed automata with silent transitions

DOI10.1007/978-3-319-22975-1_19zbMATH Open1465.68161OpenAlexW2764294725MaRDI QIDQ2945604FDOQ2945604

Authors: Florian Lorber, Amnon Rosenmann, Dejan Ničković, 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

Recommendations

• Bounded determinization of timed automata with silent transitions
• When Are Timed Automata Determinizable?
• A game approach to determinize timed automata
• A game approach to determinize timed automata
• On the determinization of timed systems

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Uppaal in a nutshell
• A theory of timed automata
• When Are Timed Automata Determinizable?
• Title not available (Why is that?)
• Undecidable Problems About Timed Automata
• Removing ε-transitions in timed automata
• Formal Modeling and Analysis of Timed Systems
• Folk theorems on the determinization and minimization of timed automata
• A game approach to determinize timed automata
• Conformance testing for real-time systems
• Bounded Determinization of Timed Automata with Silent Transitions
• Off-line test selection with test purposes for non-deterministic timed automata

Cited In (5)

• Bounded Determinization of Timed Automata with Silent Transitions
• Removing all silent transitions from timed automata
• A game approach to determinize timed automata
• When Are Timed Automata Determinizable?
• Bounded determinization of timed automata with silent transitions

This page was built for publication: Bounded determinization of timed automata with silent transitions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2945604)