Reachability in Two-Clock Timed Automata Is PSPACE-Complete.

John Fearnley Marcin Jurdzinski

Published in: ICALP (2) (2013)

Keyphrases

pspace complete
timed automata
model checking
temporal logic
reachability analysis
finite state
state space
np complete
transitive closure
strips planning
satisfiability problem
real time
database
bayesian networks