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

DOI10.1016/j.ipl.2018.03.013zbMath1457.68137arXiv1812.08948OpenAlexW2790850524WikidataQ130085686 ScholiaQ130085686MaRDI QIDQ1751409

Shang-Wei Lin, Étienne André

Publication date: 25 May 2018

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1812.08948

zbMATH Keywords

formal methodsformal languagesparametric timed automataevent-recording automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Unnamed Item

Cites Work

• Unnamed Item
• Robust parametric reachability for timed automata
• Event-clock automata: a determinizable class of timed automata
• A theory of timed automata
• Language Preservation Problems in Parametric Timed Automata
• What’s Decidable About Parametric Timed Automata?
• Learning-Based Compositional Parameter Synthesis for Event-Recording Automata
• Parametric real-time reasoning