加载中…
2013-02-13
Reachability in Two-Clock Timed Automata is PSPACE-complete
John FearnleyMarcin Jurdziński
文献摘要
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.
讨论
0讲解博客
生成讲解博客的中文版本
AI智能校验
生成AI智能校验的中文版本