There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.
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.