Recursive timed automata

DOI10.1007/978-3-642-15643-4_23MaRDI QIDQ4931300zbMATH OpenOpenAlexFDO

Authors Ashutosh Trivedi, Dominik Wojtczak

Publication date 4 October 2010

Published in Automated Technology for Verification and Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-15643-4_23

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• What's decidable about recursive hybrid automata?
• Improved undecidability results for reachability games on recursive timed automata
• Timed recursive state machines: expressiveness and complexity
• Synchronized recursive timed automata
• Time-Bounded Reachability Problem for Recursive Timed Automata is Undecidable

Cited in

(12)

• Timed Basic Parallel Processes
• Reachability relations of timed pushdown automata
• A survey of timed automata for the development of real-time systems
• Nested timed automata with frozen clocks
• Binary reachability of timed pushdown automata via quantifier elimination and cyclic order atoms
• Towards an Efficient Tree Automata based technique for Timed Systems
• Improved undecidability results for reachability games on recursive timed automata
• Context-free timed formalisms: robust automata and linear temporal logics
• Synchronized recursive timed automata
• A perfect class of context-sensitive timed languages
• scientific article; zbMATH DE number 7447746 (Why is no real title available?)
• Timed recursive state machines: expressiveness and complexity

This page was built for publication: Recursive timed automata

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