A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is
BRICS Report Series
<p>We present an extension of the model checker Uppaal capable<br /> of synthesizing linear parameter constraints for the correctness of<br />parametric timed automata. The symbolic representation of the (parametric)<br /> state-space is shown to be correct. A second contribution of this<br />paper is the identification of a subclass of parametric timed automata<br />(L/U automata), for which the emptiness problem is decidable, contrary<br />to the full class where it is know to be undecidable.doi:10.7146/brics.v8i5.20459 fatcat:2vpstirpqzhyjps3jmlcb4e2ke