Login / Signup
Reachability in Two-Clock Timed Automata is PSPACE-complete
John Fearnley
Marcin Jurdzinski
Published in:
CoRR (2013)
Keyphrases
</>
pspace complete
timed automata
model checking
temporal logic
reachability analysis
strips planning
finite state
state space
transitive closure
np complete
decision problems
coalition logic
bayesian networks
dynamic programming
satisfiability problem