Reachability in Two-Clock Timed Automata Is PSPACE-Complete
international colloquium on automata, languages and programming（2013）
摘要
Haase, Ouaknine, and Worrell have 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.
更多查看译文
关键词
log-space equivalent,bounded one-counter automaton,pspace complete
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要