Reachability in two-clock timed automata is PSPACE-complete (2015)

First Author: Fearnley J
Attributed to:  The Centre for Discrete Mathematics and its Applications (DIMAP) funded by EPSRC

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.1016/j.ic.2014.12.004

Publication URI: http://dx.doi.org/10.1016/j.ic.2014.12.004

Type: Journal Article/Review

Parent Publication: Information and Computation