Presents parametric extrapolation for dense integer-complete underapproximation of parameter sets in bounded PTAs, with terminating algorithms for reachability and related properties.
TCTL model checking lower/upper-bound parametric timed automata without invariants
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2023 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Dense Integer-Complete Synthesis for Bounded Parametric Timed Automata
Presents parametric extrapolation for dense integer-complete underapproximation of parameter sets in bounded PTAs, with terminating algorithms for reachability and related properties.