Survey concluding that non-trivial problems on parametric timed automata are undecidable in general but decidable under restrictions on the number of clocks and the use of parameters.
Parametric model checking timed automata under non-Zenoness assumption
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
What's decidable about parametric timed automata?
Survey concluding that non-trivial problems on parametric timed automata are undecidable in general but decidable under restrictions on the number of clocks and the use of parameters.