Linear Parametric Model Checking of Timed Automata

We present an extension of the model checker Uppaal capable of synthesize linear parameter constraints for the correctness of parametric timed automata. The symbolic representation of the (parametric) state-space is shown to be correct. A second contribution of this paper is the identication of a subclass of parametric timed automata (L/U automata), for which the emptiness problem is decidable, contrary to the full class where it is know to be undecidable. Also we present a number of lemmas enabling the verication eort to be reduced for L/U automata in some cases. We illustrate our approach by deriving linear parameter constraints for a number of well-known case studies from the literature (exhibiting a flaw in a published paper)

Institutional adaptation: Demands for management reform and university administration

Higher education organizations around the world have always faced environmental changes. However, in the past decade altered societal expectations, new public policies, and technological innovations have created an unprecedented set of challenges for universities. Although the borders of universities have opened in new ways for thei