Time-Bounded Reachability Problem for Recursive Timed Automata is Undecidable
From MaRDI portal
Publication:2799176
DOI10.1007/978-3-319-15579-1_18zbMath1451.68151arXiv1406.7289OpenAlexW96196053MaRDI QIDQ2799176
Lakshmi Manasa, Ashutosh Trivedi, Shankara Narayanan Krishna
Publication date: 8 April 2016
Published in: Language and Automata Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1406.7289
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items (1)
This page was built for publication: Time-Bounded Reachability Problem for Recursive Timed Automata is Undecidable