Recursive timed automata
From MaRDI portal
Publication:4931300
DOI10.1007/978-3-642-15643-4_23zbMATH Open1305.68115OpenAlexW1880663844MaRDI QIDQ4931300FDOQ4931300
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
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)
- A survey of timed automata for the development of real-time systems
- A perfect class of context-sensitive timed languages
- Binary reachability of timed pushdown automata via quantifier elimination and cyclic order atoms
- Timed recursive state machines: expressiveness and complexity
- Context-free timed formalisms: robust automata and linear temporal logics
- Nested timed automata with frozen clocks
- Improved undecidability results for reachability games on recursive timed automata
- Reachability relations of timed pushdown automata
- Synchronized recursive timed automata
- Timed Basic Parallel Processes
- Towards an Efficient Tree Automata based technique for Timed Systems
- Title not available (Why is that?)
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)
