Aug 26, 2014 · Abstract:We study reachability games on recursive timed automata (RTA) that generalize Alur-Dill timed automata with recursive procedure ...

The goal of this work was to approach reachability games on recursive timed automata from this viewpoint and to recover the decidability of these games under ...

It is found that the problem still remains undecidable for recursive timed automata with three or more clocks, so a decidability frontier is characterized ...

Mar 18, 2015 · We study reachability games on recursive timed automata (RTA) that generalize Alur-Dill timed automata with recursive procedure invocation ...

Improved Undecidability Results for Reachability Games on Recursive Timed Automata Journal Article uri icon · Overview · Other Profiles · Additional Document Info.

Dec 1, 2018 · Bibliographic details on Improved Undecidability Results for Reachability Games on Recursive Timed Automata.

The natural reachability and termination problems for recursive timed automata are shown to be decidable for automata with as few as three clocks and ...

Unfortunately, however, we answer this question in negative by showing that time-bounded reachability problem stays undecidable for RTA with 5 clocks. Download ...

Unfortunately, however, we answer this question in negative by showing that time-bounded reachability problem stays undecidable for RTA with 5 clocks.

Improved undecidability results for reachability games on recursive timed automata. SN Krishna, L Manasa, A Trivedi. arXiv preprint arXiv:1408.5968, 2014. 3 ...