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

• المؤلفون الرئيسيون: André, Étienne, Lin, Shang-Wei
• مؤلفون آخرون: School of Computer Science and Engineering
• التنسيق: مقال
• اللغة: English
• منشور في: 2020
• الموضوعات: cs.FL; Engineering::Computer science and engineering; Formal Methods; Formal Languages
• الوصول للمادة أونلاين: https://hdl.handle.net/10356/142707
• المؤسسة: Nanyang Technological University

Parametric timed automata (PTA) extend timed automata with unknown constants ("parameters"), at the price of undecidability of most interesting problems. The (untimed) language preservation problem ("given a parameter valuation, can we find at least one other valuation with the same u...