, B: its best-case execution time, 2. W : its worst-case execution time

, D: its relative deadline (i. e., the latest time after the release of the task by which it must be completed)

, B, W and D) are replaced with their value in v. Each task can have several instances, i. e., copies of the same task. An instance of task t is written (t, b, w, d) where b ? R + (resp. w ? R + ) is the best-case (resp. worst-case) remaining computation time, we denote by v(t) the task where the parameters in the timings (i. e

, A parametric task automaton is a PTA extended with 1. T : a set of tasks

É. André, M. M. Benmoussa, and C. Choppy, Formalising Concurrent UML State Machines Using Coloured Petri Nets, Advances in Intelligent Systems and Computing, vol.326, pp.473-486, 2014.

É. André, M. M. Benmoussa, and C. Choppy, Translating UML State Machines to Coloured Petri Nets Using Acceleo: A Report, Electronic Proceedings in Theoretical Computer Science, vol.150, p.9, 2014.

É. André, M. M. Benmoussa, and C. Choppy, Formalising concurrent UML state machines using coloured Petri nets, Formal Aspects of Computing, vol.28, p.9, 2016.

É. André, C. Coti, and S. Evangelista, Distributed Behavioral Cartography of Timed Automata, pp.109-114, 2014.

É. André, C. Choppy, and K. Klai, Formalizing non-concurrent UML state machines using colored Petri nets, Proceedings of the 5th International workshop UML and Formal Methods (UML&FM), vol.37, p.9, 2012.

É. André, C. Choppy, and T. Noulamo, Modelling Timed Concurrent Systems Using Activity Diagram Patterns, Advances in Intelligent Systems and Computing, vol.326, pp.339-351, 2014.

É. André, C. Coti, and H. Nguyen, Enhanced Distributed Behavioral Cartography of Parametric Timed Automata, Lecture Notes in Computer Science, vol.9407, pp.319-335, 2015.

É. André, C. Choppy, and G. Reggio, Activity Diagrams Patterns for Modeling Business Processes, vol.496, pp.197-213, 2013.

É. André, T. Chatain, and C. Rodríguez, Preserving Partial Order Runs in Parametric Time Petri Nets, Transactions on Embedded Computing Systems, vol.16, pp.75-78, 2017.

É. André, B. Delahaye, ;. Curtis, E. Dyreson, M. R. Hansen et al., Consistency in Parametric Interval Probabilistic Timed Automata". In: TIME, pp.82-85, 2016.

É. André and L. Fribourg, Behavioral Cartography of Timed Automata

, Lecture Notes in Computer Science, vol.6227, pp.76-90, 2010.

É. André, L. Fribourg, and R. Soulat, Merge and Conquer: State Merging in Parametric Timed Automata

, Lecture Notes in Computer Science. Hanoi, vol.8172, pp.381-396, 2013.

É. André, L. Fribourg, and J. Sproston, An Extension of the Inverse Method to Probabilistic Timed Automata, Formal Methods in System Design, vol.2, p.82, 2013.

É. André and D. Lime, Liveness in L/U-Parametric Timed Automata

A. Legay, K. Schneider, . Zaragoza, and . Spain, , vol.32, pp.36-40, 2017.

É. André and S. Lin, Learning-based compositional parameter synthesis for event-recording automata

, Lecture Notes in Computer Science. Best FORTE paper award and best DisCoTec paper award, vol.10321, pp.17-32, 2017.

É. André and S. Lin, The language preservation problem is undecidable for parametric event-recording automata, Information Processing Letters, vol.136, pp.17-20, 2018.

É. André, D. Lime, and N. Markey, Language Preservation Problems in Parametric Timed Automata, vol.43, p.42, 2018.

É. André, D. Lime, and O. H. Roux, Integer-Complete Synthesis for Bounded Parametric Timed Automata, Lecture Notes in Computer Science. Warsaw, vol.9328, pp.53-55, 2015.

É. André, D. Lime, and O. H. Roux, Decision Problems for Parametric Timed Automata, Lecture Notes in Computer Science, vol.10009, pp.34-37, 2016.

É. André, D. Lime, and O. H. Roux, On the Expressiveness of Parametric Timed Automata, FORMATS. Ed. by Martin Fränzle and Nicolas Markey, vol.9984, pp.29-32, 2016.

É. André, D. Lime, and M. Ramparison, TCTL model checking lower/upperbound parametric timed automata without invariants, Lecture Notes in Computer Science. To appear, vol.11022, pp.1-17, 2018.

É. André, G. Lipari, and Y. Sun, Veriication of Two Real-Time Systems Using Parametric Timed Automata, 2015.

É. André and N. Markey, Language Preservation Problems in Parametric Timed Automata, FORMATS. Ed. by Sriram Sankaranarayanan and Enrico Vicario, vol.9268, p.79, 2015.

É. André, T. Chatain, O. D. Smet, L. Fribourg, and S. Ruel, Synthèse de contraintes temporisées pour une architecture d'automatisation en réseau

, Journal Européen des Systèmes Automatisés 7-9, vol.43, p.42, 2009.

É. André, T. Chatain, E. Encrenaz, and L. Fribourg, An Inverse Method for Parametric Timed Automata, International Journal of Foundations of Computer Science, vol.20, pp.819-836, 2009.

É. 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, p.47, 2012.

É. André, Y. Liu, J. Sun, J. S. Dong, and S. Lin, PSyHCoS: Parameter Synthesis for Hierarchical Concurrent Real-Time Systems, Lecture Notes in Computer Science. Saint Petersburg, vol.8044, pp.984-989, 2013.

É. André, Y. Liu, J. Sun, and J. S. Dong, Parameter Synthesis for Hierarchical Concurrent Real-Time Systems, Real-Time Systems, vol.50, pp.620-679, 2014.

É. André, G. Lipari, G. Hoang, Y. Nguyen, and . Sun, Reachability Preservation Based Parameter Synthesis for Timed Automata, Lecture Notes in Computer Science, vol.9058, pp.61-63, 2015.

É. André, M. Knapik, W. Penczek, and L. Petrucci, Controlling Actions and Time in Parametric Timed Automata, vol.81, pp.45-54, 2016.

É. André, M. Knapik, W. J. , W. Penczek, and L. Petrucci, Timed ATL: Forget Memory, Just Count, p.10, 2017.

É. André, G. Hoang, L. Nguyen, J. Petrucci, and . Sun, Parametric model checking timed automata under non-Zenoness assumption, Lecture Notes in Computer Science. Mooett Field, vol.10227, pp.78-80, 2017.

É. André, Dynamic Clock Elimination in Parametric Timed Automata, OpenAccess Series in Informatics (OASIcs). Singapore: Schloss Dagstuhl-Leibniz-Zentrum für Informatik, vol.31, pp.18-31, 2013.

É. André, Observer Patterns for Real-Time Systems, p.9, 2013.

É. André, Parametric Deadlock-Freeness Checking Timed Automata". In: ICTAC. Ed. by Augusto Cesar Alves Sampaio and Farn Wang, vol.9965, pp.40-42, 2016.

É. André, A uniied formalism for monoprocessor schedulability analysis under uncertainty, Lecture Notes in Computer Science. Best paper award, vol.10471, pp.91-94, 2017.

É. André, What's decidable about parametric timed automata?, In: International Journal on Software Tools for Technology Transfer, 2018.

É. André, G. Hoang, L. Nguyen, and . Petrucci, EEcient parameter synthesis using optimized state exploration strategies, p.10, 2017.

É. André and L. Petrucci, Unifying Patterns for Modelling Timed Relationships in Systems and Properties, vol.1372, pp.25-40, 2015.

É. André, L. Petrucci, and G. Pellegrino, Precise Robustness Analysis of Time Petri Nets with Inhibitor Arcs, Lecture Notes in Computer Science, vol.8053, pp.72-75, 2013.

É. André and R. Soulat, Synthesis of Timing Parameters Satisfying Safety Properties, Lecture Notes in Computer Science, vol.6945, pp.70-72, 2011.

É. André and R. Soulat, The Inverse Method. FOCUS Series in Computer Engineering and Information Technology. 176 pages. ISTE Ltd and, p.9781848214477, 2013.

J. Li, J. Sun, B. Gao, and É. André, Classiication based Parameter Synthesis for Parametric Timed Automata, vol.10610, pp.243-261, 2017.

É. Shang-wei-lin, J. S. André, J. Dong, Y. Sun, and . Liu, An EEcient Algorithm for Learning Event-Recording Automata, Lecture Notes in Computer Science. Taipei, vol.6996, p.65, 2011.

Y. Shang-wei-lin, J. Liu, J. S. Sun, É. Dong, and . André, Automatic Compositional Veriication of Timed Systems, Lecture Notes in Computer Science, vol.7436, p.66, 2012.

É. Shang-wei-lin, Y. André, J. Liu, J. S. Sun, and . Dong, Learning Assumptions for Compositional Veriication of Timed Systems, Transactions on Software Engineering, vol.40, pp.137-153, 2014.

G. Lipari, Y. Sun, É. André, and L. Fribourg, Toward Parametric Timed Interfaces for Real-Time Components, Electronic Proceedings in Theoretical Computer Science, vol.145, p.97, 2014.

J. Sun, Y. Liu, J. S. Dong, Y. Liu, L. Shi et al., Modeling and Verifying Hierarchical Real-time Systems using Stateful Timed CSP, ACM Transactions on Software Engineering and Methodology, vol.22, p.9, 2013.
DOI : 10.1145/2430536.2430537

Y. Sun, R. Soulat, G. Lipari, É. André, and L. Fribourg, Parametric Schedulability Analysis of Fixed Priority Real-Time Distributed Systems
DOI : 10.1007/978-3-319-05416-2_14
URL : http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/SSLAF-ftscs13.pdf

, Communications in Computer and Information Science, vol.419, pp.88-90, 2013.

É. Tian-huat-tan, J. André, Y. Sun, J. S. Liu, M. Dong et al., Dynamic Synthesis of Local Time Requirement for Service Composition, p.10, 2013.

M. Tian-huat-tan, É. Chen, J. André, Y. Sun, J. S. Liu et al., Automated Runtime Recovery for QoS-based Service Composition, Korea: ACM SIG Proceedings, p.10, 2014.

M. Tian-huat-tan, J. Chen, Y. Sun, É. Liu, J. S. André et al., Optimizing Selection of Competing Services with Probabilistic Hierarchical Renement, p.10, 2016.

A. Parosh, G. Abdulla, O. Delzanno, A. Rezine, R. Sangnier et al., Parameterized veriication of time-sensitive models of ad hoc network protocols, Theoretical Computer Science, vol.612, p.99, 2016.

A. Aljarbouh and B. Caillaud, Robust Simulation for Hybrid Systems: Chattering Bath Avoidance, pp.175-185, 2015.

R. Alur, C. Courcoubetis, and D. L. Dill, Model-Checking in Dense Real-Time, Information and Computation, vol.104, p.23, 1993.

R. Alur and D. L. Dill, A theory of timed automata, Theoretical Computer Science, vol.126, p.45, 1994.

A. Parosh, J. Abdulla, P. Deneux, and . Mahata, Multi-Clock Timed Networks, LICS, p.99, 2004.

R. Alur, L. Fix, and T. A. Henzinger, Event-Clock Automata: A Determinizable Class of Timed Automata, Theoretical Computer Science, vol.211, pp.253-273, 1999.

T. Akazaki and I. Hasuo, Time Robustness in MTL and Expressivity in Hybrid System Falsiication, CAV, part II, vol.9207, pp.356-374, 2015.
DOI : 10.1007/978-3-319-21668-3_21

R. Alur, T. A. Henzinger, and M. Y. Vardi, Parametric real-time reasoning, vol.17, p.81, 1993.
DOI : 10.1145/167088.167242
URL : https://ecommons.cornell.edu/bitstream/1813/6111/1/93-1345.pdf

A. Parosh, B. Abdulla, and . Jonsson, Model checking of systems with many identical timed processes, Theoretical Computer Science, vol.290, p.99, 2003.

S. Akshay, L. Hélouët, C. Jard, and P. Reynier, Robustness of Time Petri Nets under Guard Enlargement, Fundamenta Informaticae, vol.143, pp.207-234, 2016.
DOI : 10.3233/fi-2016-1312
URL : https://hal.archives-ouvertes.fr/hal-00879832

A. Aljarbouh, Y. Zeng, A. Duracz, B. Caillaud, and W. Taha, ChatteringFree Simulation for Hybrid Dynamical Systems Semantics and Prototype Implementation, p.78, 2016.
DOI : 10.1109/cse-euc-dcabes.2016.217
URL : https://hal.archives-ouvertes.fr/hal-01365875

Y. Abdeddaïm and O. Maler, Job-Shop Scheduling Using Timed Automata

, Lecture Notes in Computer Science, vol.2102, p.88, 2001.

Y. Adbeddaïm and O. Maler, Preemptive Job-Shop Scheduling using Stopwatch Automata". In: TACAS. Ed. by Joost-Pieter Katoen and Perdita Stevens, vol.2280, p.88, 2002.

D. Angluin, Learning Regular Sets from Queries and Counterexamples, Information and Computation, vol.75, p.65, 1987.

L. A?tef?noaei, S. Bensalem, M. Bozga, C. Cheng, and H. Ruess, Compositional Parameter Synthesis, Lecture Notes in Computer Science, vol.9995, pp.60-68, 2016.

C. Neil and . Audsley, Optimal Priority Assignment And Feasibility Of Static Priority Tasks With Arbitrary Start Times, vol.87, 1991.

T. P. Baker, Stack-based Scheduling of Realtime Processes, Real-Time Systems, vol.3, p.88, 1991.

M. Ramzi-ben-salah, O. Bozga, and . Maler, On Interleaving in Timed Automata, CONCUR. Ed. by Christel Baier and Holger Hermanns, vol.4137, p.48, 2006.

G. Behrmann, P. Bouyer, K. G. Larsen, and R. Pelánek, Lower and upper bounds in zone-based abstractions of timed automata, International Journal on Software Tools for Technology Transfer, vol.8, issue.3, pp.204-215, 2006.

N. Bene?, P. Bezd?k, K. G. Larsen, and J. Srba, Language Emptiness of ContinuousTime Parametric Timed Automata, ICALP, Part II, vol.9135, pp.69-81, 2015.

B. Bérard, S. Haddad, A. Jovanovic, and D. Lime, Parametric Interrupt Timed Automata, Lecture Notes in Computer Science, vol.8169, p.97, 2013.

B. Bérard, S. Haddad, and C. Picaronny, Mohab Safey El Din, and Mathieu Sassolas, Lecture Notes in Computer Science, vol.9328, p.99, 2015.

H. Bowman and R. Gómez, How to stop time stopping, Formal Aspects of Computing, vol.18, p.78, 2006.

R. Bagnara, P. M. Hill, and E. Zaaanella, The Parma Polyhedra Library: Toward a Complete Set of Numerical Abstractions for the Analysis and Veriication of Hardware and Software Systems, Science of Computer Programming, vol.72, pp.3-21, 2008.

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.

P. Bouyer, N. Markey, and O. Sankur, Robust Model-Checking of Timed Automata via Pumping in Channel Machines, FORMATS. Ed. by Uli Fahrenberg and Stavros Tripakis, vol.6919, p.44, 2011.

P. Bouyer, N. Markey, and O. Sankur, Robustness in timed automata

, Lecture Notes in Computer Science, vol.8169, pp.1-18, 2013.

D. Bundala and J. Ouaknine, Advances in Parametric Real-Time Reasoning, Lecture Notes in Computer Science, vol.8634, pp.123-134, 2014.

A. Bouajjani, B. Jonsson, M. Nilsson, and T. Touili, Regular Model Checking, Lecture Notes in Computer Science, vol.1855, p.99, 2000.
URL : https://hal.archives-ouvertes.fr/hal-00161119

K. Sanjoy, L. E. Baruah, R. R. Rosier, and . Howell, Algorithms and Complexity Concerning the Preemptive Scheduling of Periodic, Real-Time Tasks on One Processor, RealTime Systems, vol.2, pp.301-324, 1990.

T. Brihaye, C. Michaux, C. Rivière, and C. Troestler, On OMinimal Hybrid Systems, Lecture Notes in Computer Science, vol.2993, p.98, 2004.

T. Brihaye, L. Doyen, G. Geeraerts, J. Ouaknine, J. Raskin et al., Time-Bounded Reachability for Monotonic Hybrid Automata: Complexity and Fixed Points, Lecture Notes in Computer Science. Hanoi, vol.8172, pp.55-70, 2013.
DOI : 10.1007/978-3-319-02444-8_6
URL : http://www.lsv.ens-cachan.fr/~doyen/papers/Time-Bounded_Reachability_for_Monotonic_Hybrid_Automata_Complexity_and_Fixed_Points.pdf

P. E. Bulychev, A. David, K. G. Larsen, M. Mikucionis, and A. Legay, Distributed Parametric and Statistical Model Checking, EPTCS. Snowbird, vol.72, p.47, 2011.
DOI : 10.4204/eptcs.72.4
URL : http://arxiv.org/pdf/1111.0370

J. Bengtsson and W. Yi, Advances in Petri Nets, Timed Automata: Semantics, Algorithms and Tools". In: Lectures on Concurrency and Petri Nets, vol.3098, pp.87-124, 2003.

R. Clarisó and J. Cortadella, Veriication of timed circuits with symbolic delays, p.42, 2004.

R. Clarisó and J. Cortadella, Veriication of Concurrent Systems with Parametric Delays Using Octahedra, In: ACSD. Saint-Malo, p.42, 2005.

M. Ceska, P. Pilar, N. Paoletti, L. Brim, and M. Z. Kwiatkowska, PRISMPSY: Precise GPU-Accelerated Parameter Synthesis for Stochastic Systems, Lecture Notes in Computer Science, vol.9636, pp.367-384, 2016.

N. Chamseddine, M. Duuot, L. Fribourg, C. Picaronny, and J. Sproston, Computing Expected Absorption Times for Parametric Determinate Probabilistic Timed Automata, QEST, p.82, 2008.
DOI : 10.1109/qest.2008.34
URL : http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/rr-lsv-2008-22.pdf

R. Chevallier, E. Encrenaz-tiphène, L. Fribourg, and W. Xu, Timed Veriication of the Generic Architecture of a Memory Circuit Using Parametric Timed Automata, Formal Methods in System Design, vol.34, pp.59-81, 2009.

F. Cassez and K. Larsen, The Impressive Power of Stopwatches, Lecture Notes in Computer Science, vol.1877, pp.138-152, 2000.

M. Chen and K. Lin, Dynamic Priority Ceilings: A Concurrency Control Protocol for Real-Time, Real-Time Systems, vol.2, p.88, 1990.
DOI : 10.1007/bf01995676

A. Cimatti, L. Palopoli, and Y. Ramadian, Symbolic Computation of Schedulability Regions Using Parametric Timed Automata, RTSS, vol.88, p.70, 2008.
DOI : 10.1109/rtss.2008.36
URL : http://feanor.sssup.it/%7Eluigi/publications/rtss08.pdf

A. Collomb, -. , and M. Sighireanu, Parameterized Reachability Analysis of the IEEE 1394 Root Contention Protocol using TReX, p.42, 2001.
URL : https://hal.archives-ouvertes.fr/hal-00110454

H. Chetto, M. Silly, and T. Bouchentouf, Dynamic Scheduling of Real-Time Tasks under Precedence Constraints, Real-Time Systems, vol.2, p.88, 1990.
DOI : 10.1007/bf00365326

P. R. D'argenio, J. Katoen, T. C. Ruys, and J. Tretmans, The Bounded Retransmission Protocol Must Be on Time, Lecture Notes in Computer Science, vol.1217, p.81, 1997.

R. I. Davis, A. Burns, J. Reinder, J. J. Bril, and . Lukkien, Controller Area Network (CAN) schedulability analysis: Refuted, revisited and revised, Real-Time Systems, vol.35, p.88, 2007.
DOI : 10.1007/s11241-007-9012-7
URL : https://link.springer.com/content/pdf/10.1007%2Fs11241-007-9012-7.pdf

A. David, Merging DBMs EEciently, p.48, 2005.

A. David, Uppaal DBM Library Programmer's Reference, p.48, 2006.

T. Dang and T. Dreossi, Falsifying Oscillation Properties of Parametric Biological Models, EPTCS. Taormina, Italy, vol.125, p.98, 2013.
DOI : 10.4204/eptcs.125.4
URL : http://arxiv.org/pdf/1309.0869

L. Martin-de-wulf, N. Doyen, J. Markey, and . Raskin, Robust safety of timed automata, Formal Methods in System Design, vol.33, p.51, 2008.

B. Delahaye, K. G. Larsen, A. Legay, L. Mikkel, A. Pedersen et al., Consistency and reenement for Interval Markov Chains, Journal of Logic and Algebraic Programming, vol.81, issue.3, p.82, 2012.

B. Delahaye, Consistency for Parametric Interval Markov Chains, United Kingdom: Schloss Dagstuhl-Leibniz-Zentrum für Informatik, vol.44, p.84, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01140752

D. Benoît-delahaye, L. Lime, and . Petrucci, Parameter Synthesis for Parametric Interval Markov Chains, vol.9583, pp.372-390, 2016.

L. Doyen, Robust Parametric Reachability for Timed Automata, In: Information Processing Letters, vol.102, p.24, 2007.

C. Daws and S. Yovine, Reducing the number of clock variables of timed automata, RTSS, p.49, 1996.

S. Evangelista, A. Laarman, L. Petrucci, and J. Van-de-pol, Improved Multi-Core Nested Depth-First Search, Lecture Notes in Computer Science, vol.7561, p.47, 2012.

E. Fersman, P. Krcál, P. Pettersson, and W. Yi, Task automata: Schedulability, decidability and undecidability, In: Information and Computation, vol.205, pp.91-93, 2007.

L. Fanchon and F. Jacquemard, Formal Timing Analysis Of Mixed Music Scores, ICMC, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00829821

L. Fribourg and U. Kühne, Parametric Veriication and Test Coverage for Hybrid Automata Using the Inverse Method, International Journal of Foundations of Computer Science, vol.24, p.99, 2013.

J. Forget, F. Boniol, E. Grolleau, D. Lesens, and C. Pagetti, Scheduling Dependent Periodic Tasks without Synchronization Mechanisms, p.10, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00800980

/. Rtas, , vol.26, p.88, 2010.

J. Forget, E. Grolleau, C. Pagetti, and P. Richard, Dynamic priority scheduling of periodic tasks with extended precedences, p.88, 2011.
URL : https://hal.archives-ouvertes.fr/inria-00638941

G. Frehse, C. L. Guernic, A. Donzé, S. Cotton, R. Ray et al., SpaceEx: Scalable Veriication of Hybrid Systems". In: CAV. Ed. by Ganesh Gopalakrishnan and Shaz Qadeer, vol.6806, p.98, 2011.

L. Fribourg, D. Lesens, P. Moro, and R. Soulat, Robustness Analysis for Scheduling Problems using the Inverse Method, pp.73-80, 2012.

R. Gómez and H. Bowman, EEcient Detection of Zeno Runs in Timed Automata, Lecture Notes in Computer Science. Salzburg, vol.4763, p.78, 2007.

O. Grinchtein, B. Jonsson, and M. Leucker, Learning of event-recording automata, Theoretical Computer Science, vol.411, p.65, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00459696

R. J. Van-glabbeek, Lecture Notes in Computer Science, The Linear Time-Branching Time Spectrum (Extended Abstract)". In: CONCUR. Ed. by Jos C. M. Baeten and Jan Willem Klop, vol.458, p.14, 1990.

J. J. Michael-gonzález-harbour, . García, C. José, J. M. Palencia-gutiérrez, and . Drake-moyano, MAST: Modeling and Analysis Suite for Real Time Applications, ECRTS, p.90, 2001.

T. A. Henzinger, P. W. Kopke, A. Puri, and P. Varaiya, What's Decidable about Hybrid Automata?, In: Journal of Computer and System Sciences, vol.57, issue.1, pp.94-124, 1998.

C. Herrera, B. Westphal, S. F. Arenis, M. Muñiz, and A. Podelski, Reducing Quasi-Equal Clocks in Networks of Timed Automata, In: FORMATS. Ed. by Marcin Jurdzinski and Dejan Nickovic, vol.7595, p.68, 2012.

T. A. Henzinger, P. W. Kopke, and H. Wong-toi, The Expressive Power of Clocks". In: ICALP. Ed. by Zoltán Fülöp and Ferenc Gécseg, vol.944, p.46, 1995.

C. A. Hoare, Communicating Sequential Processes. International Series in Computer Science, p.9, 1985.

N. Halbwachs, Y. Proy, and P. Raymond, Veriication of Linear Hybrid Systems by Means of Convex Approximations, Lecture Notes in Computer Science. Namur, vol.864, p.51, 1994.

F. Herbreteau, B. Srivathsan, and I. Walukiewicz, Lazy Abstractions for Timed Automata". In: CAV. Ed. by Natasha Sharygina and Helmut Veith, vol.8044, p.78, 2013.
DOI : 10.1007/978-3-642-39799-8_71
URL : https://hal.archives-ouvertes.fr/hal-00775924

T. Hune, J. Romijn, M. Stoelinga, and F. W. Vaandrager, Linear parametric model checking of timed automata, Journal of Logic and Algebraic Programming, vol.79, p.55, 2002.
DOI : 10.1016/s1567-8326(02)00037-1
URL : https://doi.org/10.1016/s1567-8326(02)00037-1

C. Herrera and B. Westphal, The Model Checking Problem in Networks with Quasi-Equal Clocks, p.68, 2016.

A. Jovanovi? and M. Z. Kwiatkowska, Parameter Synthesis for Probabilistic Timed Automata Using Stochastic Game Abstractions, Lecture Notes in Computer Science, vol.8762, p.82, 2014.

B. Jonsson and K. Larsen, Speciication and Reenement of Probabilistic Processes, LICS, p.82, 1991.

A. Jovanovic, D. Lime, and O. H. Roux, Synthesis of Bounded Integer Parameters for Parametric Timed Reachability Games, Lecture Notes in Computer Science. Hanoi, vol.8172, p.99, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00940988

A. Jovanovi?, D. Lime, and O. H. Roux, Integer Parameter Synthesis for Timed Automata, IEEE Transactions on Software Engineering, vol.41, pp.445-461, 1999.

A. Jovanovi?, Parametric Veriication of Timed Systems, p.23, 2013.

V. Khomenko and . Punf, , p.77

M. Knapik, A. M?ski, and W. Penczek, Action Synthesis for Branching Time Logic: Theory and Applications, ACM Transactions on Embedded Computing, vol.14, p.81, 2015.

M. Knapik and W. Penczek, Bounded Model Checking for Parametric Timed Automata". In: Transactions on Petri Nets and Other Models of Concurrency, Lecture Notes in Computer Science, vol.6900, pp.141-159, 2012.

M. Z. Kwiatkowska, G. Norman, J. Sproston, and F. Wang, Symbolic Model Checking for Probabilistic Timed Automata, Information and Computation 205, vol.7, p.42, 2007.

A. Laarman, M. Chr, A. E. Olesen, K. G. Dalsgaard, J. Larsen et al., Multi-Core Emptiness Checking of Timed Büchi Automata using Inclusion Abstraction, vol.8044, p.47, 2013.

R. Langerak, J. Van-de-pol, J. N. Post, and S. Schivo, Improving the Timed Automata Approach to Biological Pathway Dynamics". In: Models, Algorithms, Logics and Tools-Essays Dedicated to Kim Guldstrand Larsen on the Occasion of His 60th Birthday, Lecture Notes in Computer Science, vol.10460, p.98, 2017.

L. Li, J. Sun, Y. Liu, and J. S. Dong, Verifying Parameterized Timed Security Protocols, Lecture Notes in Computer Science. Oslo, vol.9109, p.99, 2015.

C. L. Liu and J. W. Layland, Scheduling Algorithms for Multiprogramming in a HardReal-Time Environment, Journal of the ACM, vol.20, pp.4-5411, 1973.

F. Laroussinie, N. Markey, and G. Oreiby, Model-Checking Timed, Lecture Notes in Computer Science, vol.4202, p.10, 2006.
URL : https://hal.archives-ouvertes.fr/hal-01194617

R. Lanotte, A. Maggiolo-schettini, and A. Troina, Decidability Results for Parametric Probabilistic Transition Systems with an Application to Security, SEFM. Beijing, p.99, 2004.

R. Lanotte, A. Maggiolo-schettini, and A. Troina, Parametric probabilistic transition systems for system design and analysis", In: Formal Aspects of Computing, vol.19, p.99, 2007.

L. Li, J. Sun, and J. S. Dong, Automated Veriication of Timed Security Protocols with Clock Drift, Lecture Notes in Computer Science. Limassol, Cyprus, vol.9995, p.99, 2016.

J. Leung and J. Whitehead, On the complexity of xed-priority scheduling of periodic, real-time tasks, Performance Evaluation, vol.2, pp.90024-90028, 1982.

N. Markey, Robustness in Real-time Systems, p.51, 2011.

M. Philip-meir, A study of the recoverability of computing systems, p.72, 1974.

J. S. Miller, Decidability and Complexity Results for Timed Automata and Semi-linear Hybrid Automata, Lecture Notes in Computer Science, vol.1790, p.32, 2000.

M. L. Minsky, Computation: nite and innnite machines, vol.32, p.33, 1967.

M. Muñiz, B. Westphal, and A. Podelski, Detecting Quasi-equal Clocks in Timed Automata, Lecture Notes in Computer Science, vol.8053, p.68, 2013.

C. Norström, A. Wall, and W. Yi, Timed Automata as Task Models for EventDriven Systems, vol.91, p.9, 1999.

. Omg, Uniied Modeling Language Superstructure, Version 2, p.9

J. Ouaknine and J. Worrell, Towards a Theory of Time-Bounded Veriication, ICALP Part II, vol.6199, p.23, 2010.

C. P. José, M. Gutiérrez, and . Harbour, Schedulability Analysis for Tasks with Static and Dynamic OOsets, RTSS, vol.90, p.88, 1998.

T. Quatmann, C. Dehnert, N. Jansen, S. Junges, and J. Katoen, Parameter Synthesis for Markov Models: Faster Than Ever, Lecture Notes in Computer Science. Chiba, Japan, vol.9938, p.99, 2016.

A. Rocca, T. Dang, E. Fanchon, and J. M. Moulis, Application of the Reachability Analysis for the Iron Homeostasis Study, Lecture Notes in Computer Science, vol.9957, p.98, 2016.

C. Rodríguez, M. Sousa, S. Sharma, and D. Kroening, Unfolding-based Partial Order Reduction, Schloss Dagstuhl-Leibniz-Zentrum für Informatik, vol.42, p.77, 2015.

H. Olivier and . Didier-lime-roux, Time Petri Nets with Inhibitor Hyperarcs. Formal Semantics and State Space Computation, Lecture Notes in Computer Science, vol.3099, p.74, 2004.

C. Rodríguez and S. Schwoon, Cunf: A Tool for Unfolding and Verifying Petri Nets with Read Arcs, Lecture Notes in Computer Science. Hanoi, vol.8172, p.78, 2013.

O. Sankur, Untimed Language Preservation in Timed Systems, MFCS, vol.6907, pp.556-567, 2011.

O. Sankur, Symbolic Quantitative Robustness Analysis of Timed Automata
URL : https://hal.archives-ouvertes.fr/hal-01244766

, Lecture Notes in Computer Science. London, vol.9035, p.70, 2015.

O. Sankur, P. Bouyer, and N. Markey, Shrinking timed automata, Information and Computation, vol.234, pp.107-132, 2014.

S. Schivo, J. Scholma, B. Wanders, R. A. Camacho, P. E. Van-der et al., Modelling biological pathway dynamics with Timed Automata, p.98, 2012.

A. Schrijver, Theory of linear and integer programming, p.12, 1986.

D. Seto, J. P. Lehoczky, and L. Sha, Task Period Selection and Schedulability in Real-Time Systems, RTSS, p.90, 1998.

M. Spuri, Analysis of Deadline Scheduled Real-Time Systems, vol.87, 1996.
URL : https://hal.archives-ouvertes.fr/inria-00073920

G. Su, Y. Feng, T. Chen, and D. S. Rosenblum, Asymptotic Perturbation Bounds for Probabilistic Model Checking with Empirically Determined Probability Parameters, Transactions on Software Engineering, vol.42, p.99, 2016.

J. Sun, Y. Liu, J. S. Dong, and J. Pang, PAT: Towards Flexible Veriication under Fairness, Lecture Notes in Computer Science, vol.5643, p.66, 2009.

L. Traonouez, D. Lime, and O. H. Roux, Parametric Model-Checking of Stopwatch Petri Nets, Journal of Universal Computer Science, vol.15, pp.3273-3304, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00489033

L. Traonouez, A Parametric Counterexample Reenement Approach for Robust Timed Speciications, Electronic Proceedings in Theoretical Computer Science, vol.87, p.70, 2012.

S. Tripakis, Verifying Progress in Timed Systems, In: ARTS. Ed. by Joost-Pieter Katoen, vol.1601, p.78, 1999.

S. Tripakis and S. Yovine, Analysis of Timed Systems Using Time-Abstracting Bisimulations, Formal Methods in System Design, vol.18, p.37, 2001.

S. Tripakis, S. Yovine, and A. Bouajjani, Checking Timed Büchi Automata Emptiness EEciently, Formal Methods in System Design, vol.26, p.78, 2005.

E. Wandeler, L. Thiele, M. Verhoef, and P. Lieverse, System architecture evaluation using modular performance analysis: a case study, International Journal on Software Tools for Technology Transfer, vol.8, issue.6, p.90, 2006.

T. Wang, J. Sun, Y. Liu, X. Wang, and S. Li, Are Timed Automata Bad for a Speciication Language? Language Inclusion Checking for Timed Automata

, Erika Ábrahám and Klaus Havelund, vol.8413

F. Grenoble, , p.69, 2014.

T. Wang, J. Sun, X. Wang, Y. Liu, Y. Si et al., A Systematic Study on Explicit-State Non-Zenoness Checking for Timed Automata, IEEE Transactions on Software Engineering, vol.41, pp.3-18, 2015.

Z. Zhang, B. Nielsen, and K. Larsen, Distributed Algorithms for Time Optimal Reachability Analysis, FORMATS. Ed. by Martin Fränzle and Nicolas Markey, vol.9884, p.47, 2016.

Z. Zhang, B. Nielsen, and K. Larsen, Time optimal reachability analysis using swarm veriication, vol.68, p.47, 2016.