paper

Reachability in Two-Clock Timed Automata is PSPACE-complete

arXiv:1302.3109 · doi:10.1016/j.ic.2014.12.004

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.

Cited by in corpus (5)