Linear Parametric Model Checking of Timed Automata

Thomas S. Hune, Judi Romijn, Mariëlle Stoelinga, Frits W. Vaandrager
2001 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.
more » ... to be undecidable. Also we present a<br />number of lemmas enabling the verification effort to be reduced for L/U<br />automata in some cases. We illustrate our approach by deriving linear<br />parameter constraints for a number of well-known case studies from the<br />literature (exhibiting a flaw in a published paper).</p>
doi:10.7146/brics.v8i5.20459 fatcat:2vpstirpqzhyjps3jmlcb4e2ke