Reachability in two-parametric timed automata with one parameter is EXPSPACE-complete.

Stefan Göller Mathieu Hilaire

Published in: CoRR (2020)

Keyphrases

timed automata
model checking
pspace complete
temporal logic
reachability analysis
database
parameter values
satisfiability problem
state space
theorem prover
transitive closure
neural network
knowledge base
evolutionary algorithm
first order logic
theorem proving