Presents parametric extrapolation for dense integer-complete underapproximation of parameter sets in bounded PTAs, with terminating algorithms for reachability and related properties.
A study of the recov- erability of computing systems
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.LO 2verdicts
UNVERDICTED 2representative citing papers
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.
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.