Reachability in Two-Clock Timed Automata Is PSPACE-Complete

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.1007/978-3-642-39212-2_21

Publication URI: http://dx.doi.org/10.1007/978-3-642-39212-2_21

Type: Book Chapter

Book Title: Automata, Languages, and Programming (2013)

Page Reference: 212-223

ISBN: 978-3-642-39211-5