John Fearnley, Marcin Jurdzinski
Reachability in Two-Clock Timed Automata Is PSPACE-Complete
ICALP, 2013.
@inproceedings{ICALP-v2-2013-FearnleyJ,
author = "John Fearnley and Marcin Jurdzinski",
booktitle = "{Proceedings of the 40th International Colloquium on Automata, Languages, and Programming, Part II}",
doi = "10.1007/978-3-642-39212-2_21",
isbn = "978-3-642-39211-5",
pages = "212--223",
publisher = "{Springer International Publishing}",
series = "{Lecture Notes in Computer Science}",
title = "{Reachability in Two-Clock Timed Automata Is PSPACE-Complete}",
volume = 7966,
year = 2013,
}











