2013/02/20 by John Fearnley, Marcin Jurdziński · 1 citation
Computer Science · #cs.FL
paper · pdf · doi:10.1016/j.ic.2014.12.004
arxiv created 2013/02/20 · arxiv updated 2020/01/15
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.