Reachability in two-clock timed automata is PSPACE-complete.

John Fearnley Marcin Jurdzinski

Published in: Inf. Comput. (2015)

Keyphrases

pspace complete
timed automata
model checking
temporal logic
reachability analysis
strips planning
state space
finite state
transitive closure
np complete
satisfiability problem
real time
decision making
search algorithm