The language preservation problem is undecidable for parametric event-recording automata

Étienne André, Shang-Wei Lin

Parametric timed automata (PTA) extend timed automata with unknown constants ("parameters"), at the price of undecidability of most interesting problems. The (untimed) language pre…