Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Improved Undecidability Results for Reachability Games on Recursive
  Timed Automata   We study reachability games on recursive timed automata (RTA) that generalize
Alur-Dill timed automata with recursive procedure invocation mechanism similar
to recursive state machines. It is known that deciding the winner in
reachability games on RTA is undecidable for automata with two or more clocks,
while the problem is decidable for automata with only one clock. Ouaknine and
Worrell recently proposed a time-bounded theory of real-time verification by
claiming that restriction to bounded-time recovers decidability for several key
decision problem related to real-time verification. We revisited games on
recursive timed automata with time-bounded restriction in the hope of
recovering decidability. However, we found that the problem still remains
undecidable for recursive timed automata with three or more clocks. Using
similar proof techniques we characterize a decidability frontier for a
generalization of RTA to recursive stopwatch automata.

23
The categories of this paper are: solv-int
36
The categories of this paper are: cmp-lg
9
The categories of this paper are: nlin
3
The categories of this paper are: physics
37
The categories of this paper are: supr-con
19
The categories of this paper are: eess
28
The categories of this paper are: alg-geom
22
The categories of this paper are: chao-dyn
27
The categories of this paper are: comp-gas
33
The categories of this paper are: plasm-ph
35
The categories of this paper are: mtrl-th
24
The categories of this paper are: dg-ga
13
The categories of this paper are: quant-ph
5
The categories of this paper are: gr-qc
15
The categories of this paper are: nucl-ex
12
The categories of this paper are: nucl-th