@article{FearnleyJurdziski:IC:2015,
Abstract = {Abstract Recently, 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.},
Author = {Fearnley, John and Jurdzi{\'n}ski, Marcin},
File = {Reachability in two-clock timed automata is PSPACE-complete - Fearnley, Jurdziński (1) (0) - a - a - v.pdf},
ISSN = {0890-5401},
Journal = {Information and Computation},
Keywords = {PSPACE-complete},
Pages = {26--36},
Title = {Reachability in two-clock timed automata is PSPACE-complete},
URL = {http://www.sciencedirect.com/science/article/pii/S0890540114001564},
Volume = {243},
Year = {2015},
bdsk-url-1 = {http://www.sciencedirect.com/science/article/pii/S0890540114001564},
bdsk-url-2 = {http://dx.doi.org/10.1016/j.ic.2014.12.004},
date-added = {2015-11-09 10:22:02 +0000},
date-modified = {2020-05-07 07:29:18 +0200},
doi = {10.1016/j.ic.2014.12.004}
}
Library Size: 13G (12941 entries),
Last Updated: Apr 04, 2026, 18:14:59,
Build Time: N/A