We study timed systems in which some timing features are unknown parameters. Parametric timed automata (PTAs) are a classical formalism for such systems but for which most interesting problems are undecidable. Notably. the parametric reachability emptiness problem. https://parisnaturalfoodes.shop/product-category/larch/