Reachability in Two-Parametric Timed Automata with One Parameter Is EXPSPACE-Complete.

Stefan Göller Mathieu Hilaire

Published in: STACS (2021)

Keyphrases

timed automata
model checking
pspace complete
temporal logic
reachability analysis
state space
theorem prover
image segmentation
theorem proving
databases
single parameter
first order logic
np complete
search algorithm
software systems
multiscale
case study
information retrieval
data sets