collaborators

1 paper

cs.FL2020

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

Stefan Göller, Mathieu Hilaire

Parametric timed automata (PTA) are an extension of timed automata in which clocks can be compared against parameters. The reachability problem asks for the existence of an assignm…