Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6874155 | Information Processing Letters | 2018 | 11 Pages |
Abstract
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).
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Ãtienne André, Shang-Wei Lin,