2000 character limit reached
Reachability in Two-Clock Timed Automata is PSPACE-complete (1302.3109v2)
Published 13 Feb 2013 in cs.FL
Abstract: A recent result of Haase et al. has shown that reachability in two-clock timed automata is log-space equivalent to reachability in bounded one-counter automata. We show that reachability in bounded one-counter automata is PSPACE-complete.