Bounded determinization of timed automata with silent transitions

DOI10.1007/978-3-319-22975-1_19MaRDI QIDQ2945604zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

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

Cites work

• scientific article; zbMATH DE number 1337733 (Why is no real title available?)
• A game approach to determinize timed automata
• A theory of timed automata
• Bounded determinization of timed automata with silent transitions
• Conformance testing for real-time systems
• Folk theorems on the determinization and minimization of timed automata
• Formal Modeling and Analysis of Timed Systems
• Off-line test selection with test purposes for non-deterministic timed automata
• Removing -transitions in timed automata
• Undecidable Problems About Timed Automata
• Uppaal in a nutshell
• When Are Timed Automata Determinizable?

Cited in

(5)

• 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
• 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)