R. Alur and D. L. Dill, A theory of timed automata, Theoretical Computer Science, vol.126, issue.2, pp.183-235, 1994.

E. André, L. Fribourg, U. Kühne, and R. Soulat, IMITATOR 2.5: A tool for analyzing robustness in scheduling problems, Lecture Notes in Computer Science, vol.7436, pp.33-36, 2012.

R. Alur, T. A. Henzinger, and M. Y. Vardi, Parametric real-time reasoning, STOC, pp.592-601, 1993.

E. André and D. Lime, Liveness in L/U-parametric timed automata, pp.9-18, 2017.

E. André, D. Lime, and O. H. Roux, Decision problems for parametric timed automata, Lecture Notes in Computer Science, vol.10009, pp.400-416, 2016.

E. André, D. Lime, and O. H. Roux, On the expressiveness of parametric timed automata, FORMATS, vol.9984, pp.19-34, 2016.

E. André, What's decidable about parametric timed automata?, International Journal on Software Tools for Technology Transfer, 2017.

N. Bene?, P. Bezd?k, K. G. Larsen, and J. Srba, Language emptiness of continuous-time parametric timed automata, ICALP, Part II, vol.9135, pp.69-81, 2015.

P. Bouyer, C. Dufourd, E. Fleury, and A. Petit, Updatable timed automata, Theoretical Computer Science, vol.321, issue.2-3, pp.291-345, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00350196

L. Bozzelli and S. L. Torre, Decision problems for lower/upper bound parametric timed automata. Formal Methods in System Design, vol.35, pp.121-151, 2009.

K. G. Bll-+-95]-johan-bengtsson, F. Larsen, P. Larsson, W. Pettersson, and . Yi, UPPAAL-a Tool Suite for Automatic Verification of Real-Time Systems, Proc. of Workshop on Verification and Control of Hybrid Systems III, number 1066 in Lecture Notes in Computer Science, pp.232-243, 1995.

J. Bengtsson and W. Yi, Timed automata: Semantics, algorithms and tools, Jörg Desel, Wolfgang Reisig, and Grzegorz Rozenberg, vol.3098, pp.87-124, 2003.

F. Cassez and K. Larsen, The impressive power of stopwatches, Lecture Notes in Computer Science, vol.1877, pp.138-152, 2000.

L. Doyen, Robust parametric reachability for timed automata, Information Processing Letters, vol.102, issue.5, pp.208-213, 2007.

T. A. Henzinger, P. W. Kopke, A. Puri, and P. Varaiya, What's decidable about hybrid automata?, Journal of Computer and System Sciences, vol.57, issue.1, pp.94-124, 1998.

T. Hune, J. Romijn, M. Stoelinga, and F. W. Vaandrager, Linear parametric model checking of timed automata, Journal of Logic and Algebraic Programming, pp.183-220, 2002.

A. Jovanovi´cjovanovi´c, D. Lime, and O. H. Roux, Integer parameter synthesis for timed automata, IEEE Transactions on Software Engineering, vol.41, issue.5, pp.445-461, 2015.

J. S. Miller, Decidability and complexity results for timed automata and semi-linear hybrid automata, Lecture Notes in Computer Science, vol.1790, pp.296-309, 2000.

J. Walter and . Savitch, Relationships between nondeterministic and deterministic tape complexities, Journal of Computer and System Sciences, vol.4, issue.2, pp.177-192, 1970.