A subclass with only upper-bound invariants is claimed to make parametric reachability easy and exactly synthesizable, but negative constant offsets break the proof.
Pittsburgh, PA, USA: Springer, 2000, pp
1 Pith paper cite this work, alongside 174 external citations. Polarity classification is still indexing.
1
Pith paper citing it
174
external citations · OpenAlex
fields
cs.FL 1years
2019 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
On the expressive power of invariants in parametric timed automata
A subclass with only upper-bound invariants is claimed to make parametric reachability easy and exactly synthesizable, but negative constant offsets break the proof.