The language preservation problem is undecidable for parametric event-recording automata - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Information Processing Letters Année : 2018

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

Résumé

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 untimed language?") is undecidable for PTAs. We prove that this problem remains undecidable for parametric event-recording automata (PERAs), a subclass of PTAs that considerably restrains the way the language can be used; we also show it remains undecidable even for slightly different definitions of the language, i.e., finite sequences of actions ending in or passing infinitely often through accepting locations, or just all finite untimed words (without accepting locations).

Dates et versions

hal-01965926 , version 1 (27-12-2018)

Identifiants

Citer

Étienne André, Shang-Wei Lin. The language preservation problem is undecidable for parametric event-recording automata. Information Processing Letters, 2018, 136, pp.17-20. ⟨10.1016/j.ipl.2018.03.013⟩. ⟨hal-01965926⟩
31 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More