Y. Adbeddaïm, E. Asarin, and O. Maler, Scheduling with timed automata, Theoretical Computer Science, vol.354, issue.2, pp.272-300, 2006.

E. Asarin and A. Bouajjani, Perturbed Turing machines and hybrid systems, Proceedings 16th Annual IEEE Symposium on Logic in Computer Science, pp.269-278, 2001.
DOI : 10.1109/LICS.2001.932503
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.23.3070

S. Akshay, B. Bollig, P. Gastin, M. Mukund, K. Narayan et al., Distributed Timed Automata with Independently Evolving Clocks, Proceedings of the 19th International Conference on Concurrency Theory, pp.82-97, 2008.
DOI : 10.1007/978-3-540-85361-9_10
URL : https://hal.archives-ouvertes.fr/hal-01089524

[. Alur, M. Bernadsky, and P. Madhusudan, Optimal Reachability for Weighted Timed Games, Automata, Languages and Programming, pp.122-133, 2004.
DOI : 10.1007/978-3-540-27836-8_13

[. Alur, C. Courcoubetis, and D. L. Dill, Model-Checking in Dense Real-Time, Information and Computation, vol.104, issue.1
DOI : 10.1006/inco.1993.1024

[. Abdellatif, J. Combaz, and J. Sifakis, Model-based implementation of real-time applications, Proceedings of the tenth ACM international conference on Embedded software, EMSOFT '10, pp.229-238, 2010.
DOI : 10.1145/1879021.1879052

R. Alur and D. L. Dill, Automata for modeling real-time systems
DOI : 10.1007/BFb0032042

R. Alur and D. L. Dill, The theory of timed automata, Lecture Notes in Computer Science, vol.600, pp.45-73, 1992.
DOI : 10.1007/BFb0031987

R. Alur and D. L. Dill, A theory of timed automata, Theoretical Computer Science, vol.126, issue.2, pp.183-235, 1994.
DOI : 10.1016/0304-3975(94)90010-8

[. Alur, L. Fix, and T. A. Henzinger, Event-clock automata: a determinizable class of timed automata, Theoretical Computer Science, vol.211, issue.1-2, pp.253-273, 1999.
DOI : 10.1016/S0304-3975(97)00173-4

É. André, L. Fribourg, U. Kühne, and R. Soulat, IMITATOR 2.5: A Tool for Analyzing Robustness in Scheduling Problems, Proceedings of the 18th International Symposium on Formal Methods (FM'12), 2012.
DOI : 10.1007/978-3-642-32759-9_6

T. Amnell, E. Fersman, L. Mokrushin, P. Pettersson, and W. Yi, TIMES b??? A Tool for Modelling and Implementation of Embedded Systems, TACAS, pp.460-464, 2002.
DOI : 10.1007/3-540-46002-0_32

S. Akshay, L. Hélouët, C. Jard, and P. Reynier, Robustness of Time Petri Nets under Guard Enlargement, Lecture Notes in Computer Science, vol.7550, pp.92-106, 2012.
DOI : 10.1007/978-3-642-33512-9_9
URL : https://hal.archives-ouvertes.fr/hal-01379431

R. Alur, F. Ivancic, J. Kim, I. Lee, and O. Sokolsky, Generating embedded software from hierarchical hybrid models, ACM SIGPLAN Notices, vol.38, issue.7, pp.171-182, 2003.
DOI : 10.1145/780731.780756

[. Abdulla, P. Kr?ál, and W. Yi, Sampled semantics of timed automata, Logical Methods in Computer Science, vol.6, issue.3, p.14, 2010.

[. Alur, S. Latorre, and P. Madhusudan, Perturbed Timed Automata, Hybrid Systems: Computation and Control, pp.70-85, 2005.
DOI : 10.1007/978-3-540-31954-2_5

E. Asarin, O. Maler, and A. Pnueli, Symbolic controller synthesis for discrete and timed systems, Hybrid Systems II, pp.1-20, 1995.
DOI : 10.1007/3-540-60472-3_1

E. Asarin, O. Maler, and A. Pnueli, On discretization of delays in timed automata and digital circuits, CONCUR'98 Concurrency Theory, pp.470-484, 1998.
DOI : 10.1007/BFb0055642

E. Asarin, O. Maler, A. Pnueli, and J. Sifakis, Controller synthesis for timed automata, Proceedings of the 5th IFAC Cconference on System Structure and Control (SSC'98), pp.469-474, 1998.

K. Altisen and S. Tripakis, Implementation of Timed Automata: An Issue of Semantics or Modeling?, Proceedings of the 3rd International Conferences on Formal Modelling and Analysis of Timed Systems, pp.273-288
DOI : 10.1007/11603009_21

[. Alur, S. L. Torre, and G. J. Pappas, Optimal paths in weighted timed automata, Proceedings of the 4th International Workshop on Hybrid Systems: Computation and Control, HSCC '01, pp.49-62, 2001.

N. Basset and E. Asarin, Thin and Thick Timed Regular Languages, Formal Modeling and Analysis of Timed Systems, pp.113-128, 2011.
DOI : 10.1007/s00165-005-0067-8
URL : https://hal.archives-ouvertes.fr/hal-00793583

P. Bouyer, T. Brihaye, V. Bruyère, and J. Raskin, On the optimal reachability problem on weighted timed automata. Formal Methods in System Design, pp.135-175, 2007.

[. Bouyer, T. Brihaye, and N. Markey, Improved undecidability results on weighted timed automata, Information Processing Letters, vol.98, issue.5, pp.188-194, 2006.
DOI : 10.1016/j.ipl.2006.01.012
URL : https://hal.archives-ouvertes.fr/hal-01194609

T. Brihaye, V. Bruyère, and J. Raskin, On Optimal Timed Strategies, Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems, FORMATS'05, pp.49-64, 2005.
DOI : 10.1007/11603009_5

T. Brihaye, V. Bruyère, and J. Raskin, On Optimal Timed Strategies, Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems, FORMATS'05, pp.49-64, 2005.
DOI : 10.1007/11603009_5

P. Bouyer and F. Chevalier, On conciseness of extensions of timed automata, Journal of Automata, Languages and Combinatorics, vol.10, issue.4, pp.393-405, 2005.

[. Bouyer, F. Cassez, E. Fleury, and K. G. Larsen, Optimal Strategies in Priced Timed Game Automata, Foundations of Software Technology and Theoretical Computer Science, pp.148-160, 2004.
DOI : 10.1007/978-3-540-30538-5_13
URL : https://hal.archives-ouvertes.fr/hal-00350483

F. Baccelli, G. Cohen, G. J. Olsder, and J. Quadrat, Synchronization and Linearity ? An Algebra For Discrete Event Systems, 1992.

P. Bouyer, C. Dufourd, E. Fleury, and A. Petit, Are Timed Automata Updatable?, Proceedings of the 12th International Conference on Computer Aided Verification, pp.464-479, 2000.
DOI : 10.1007/10722167_35
URL : https://hal.archives-ouvertes.fr/hal-00350488

M. Bozga, C. Daws, O. Maler, A. Olivero, S. Tripakis et al., Kronos: A model-checking tool for real-time systems, CAV '98: Proceedings of the 10th International Conference on Computer Aided Verification, pp.546-550, 1998.
URL : https://hal.archives-ouvertes.fr/hal-00374788

[. Berry, The foundations of Esterel, Proof, Language, and Interaction ? Essays in Honour of Robin Milner, pp.425-454, 2000.

A. Bfh-+-01-]-gerd-behrmann, T. Fehnker, K. Hune, P. Larsen, J. Pettersson et al., Minimum-Cost Reachability for Priced Time Automata, Hybrid Systems: Computation and Control, pp.147-161, 2001.
DOI : 10.1007/3-540-45351-2_15

J. Bermond, A. Germa, M. Heydemann, and D. Sotteau, Longest paths in digraphs, Combinatorica, vol.15, issue.4, pp.337-341, 1981.
DOI : 10.1007/BF02579454

[. Brenguier, S. Göller, and O. Sankur, A Comparison of Succinctly Represented Finite-State Systems, Proceedings of the 23rd International Conference on Concurrency Theory (CONCUR'12), pp.147-161, 2012.
DOI : 10.1007/978-3-642-32940-1_12

V. Bandur, W. Kahl, and A. Wassyng, Microcontroller Assembly Synthesis from Timed Automaton Task Specifications, Formal Methods for Industrial Critical Systems, pp.63-77, 2012.
DOI : 10.1007/978-3-642-32469-7_5

P. Bouyer, K. G. Larsen, N. Markey, O. Sankur, and C. Thrane, Timed Automata Can Always Be Made Implementable, Proceedings of the 22nd International Conference on Concurrency Theory (CONCUR'11), pp.76-91, 2011.
DOI : 10.1016/j.jlap.2010.07.010
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.396.9857

[. Beyer, C. Lewerentz, and A. Noack, Rabbit: A Tool for BDD-Based Verification of Real-Time Systems, Computer Aided Verification, pp.122-125, 2003.
DOI : 10.1007/978-3-540-45069-6_13

[. Berthomieu and M. Menasche, An enumerative approach for analyzing time Petri nets, Information Processing 83 ? Proceedings of the 9th IFIP World Computer Congress (WCC'83), pp.41-46, 1983.

[. Bouyer, N. Markey, J. Ouaknine, and J. Worrell, The Cost of Punctuality, 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007), pp.109-118, 2007.
DOI : 10.1109/LICS.2007.49
URL : https://hal.archives-ouvertes.fr/hal-01194604

M. Bozga, O. Maler, A. Pnueli, and S. Yovine, Some progress in the symbolic verification of timed automata, Proc. 9th International Conference on Computer Aided Verification (CAV'97, pp.179-190, 1997.
DOI : 10.1007/3-540-63166-6_19
URL : https://hal.archives-ouvertes.fr/hal-00374086

[. Bouyer, N. Markey, and P. Reynier, Robust Model-Checking of Linear-Time Properties in Timed Automata, Proceedings of the 7th Latin American Symposium on Theoretical INformatics, pp.238-249, 2006.
DOI : 10.1007/11682462_25
URL : https://hal.archives-ouvertes.fr/hal-01194610

[. Bouyer, N. Markey, and P. Reynier, Robust Analysis of Timed Automata Via Channel Machines, Proceedings of the 11th International Conference on Foundations of Software Science and Computation Structure (FoSSaCS'08), pp.157-171
DOI : 10.1007/978-3-540-78499-9_12
URL : https://hal.archives-ouvertes.fr/hal-01194593

[. Bouyer, N. Markey, and O. Sankur, Robust Model-Checking of Timed Automata via Pumping in Channel Machines, Proceedings of the 9th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS'11), pp.97-112, 2011.
DOI : 10.1007/s100090050009

[. Bouyer, N. Markey, and O. Sankur, Robust Reachability in Timed Automata: A??Game-Based??Approach, Proceedings of the 39th International Colloquium on Automata, Languages and Programming (ICALP'12) ? Part II, pp.128-140, 2012.
DOI : 10.1007/978-3-642-31585-5_15
URL : https://hal.archives-ouvertes.fr/hal-01105077

J. Bengtsson and W. Yi, Timed Automata: Semantics, Algorithms and Tools, Lectures on Concurrency and Petri Nets, pp.87-124
DOI : 10.1007/978-3-540-27755-2_3

A. Cassez, E. David, K. G. Fleury, L. Larsen, and . Didier, Efficient On-the-Fly Algorithms for the Analysis of Timed Games, CONCUR 2005, pp.66-80, 2005.
DOI : 10.1007/11539452_9
URL : https://hal.archives-ouvertes.fr/hal-00350475

[. Chatterjee, T. A. Henzinger, and V. S. Prabhu, Timed parity games: Complexity and robustness, Logical Methods in Computer Science, vol.7, issue.4, 2011.
DOI : 10.2168/lmcs-7(4:8)2011
URL : http://arxiv.org/abs/0807.1165

[. Cassez, T. A. Henzinger, and J. Raskin, A Comparison of Control Problems for Timed and Hybrid Systems, Proceedings of the 5th International Workshop on Hybrid Systems: Computation and Control (HSCC'02), volume 2289 of Lecture Notes in Computer Science, pp.134-148, 2002.
DOI : 10.1007/3-540-45873-5_13

P. Caspi and O. Maler, From control loops to real-time programs. Handbook of networked and embedded control systems, pp.395-418, 2005.

L. Martin-de-wulf, N. Doyen, J. Markey, and . Raskin, Robust safety of timed automata. Formal Methods in System Design, pp.45-84, 2008.

L. Martin-de-wulf, J. Doyen, and . Raskin, Almost ASAP semantics: from timed models to timed implementations, Formal Aspects of Computing, vol.17, issue.3, pp.319-341, 2005.
DOI : 10.1007/s00165-005-0067-8

L. Martin-de-wulf, J. Doyen, and . Raskin, Systematic Implementation of Real-Time Models, FM 2005: Formal Methods, pp.139-156, 2005.
DOI : 10.1007/11526841_11

A. David, J. Håkansson, K. G. Larsen, and P. Pettersson, Model Checking Timed Automata with Priorities Using DBM Subtraction, Proceedings of the 4th International Conferences on Formal Modelling and Analysis of Timed Systems, pp.128-142, 2006.
DOI : 10.1007/11867340_10

H. Dierks, PLC-automata: a new class of implementable real-time automata, Theoretical Computer Science, vol.253, issue.1, pp.61-93, 2001.
DOI : 10.1016/S0304-3975(00)00089-X

L. David and . Dill, Timing assumptions and verification of finite-state concurrent systems, Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems (AVMFSS'89), pp.197-212, 1990.

C. Dima, Dynamical Properties of Timed Automata Revisited, Lecture Notes in Computer Science, vol.4763, pp.130-146, 2007.
DOI : 10.1007/978-3-540-75454-1_11

[. Daws and P. Kordy, Symbolic Robustness Analysis of Timed Automata
DOI : 10.1007/11867340_11

[. Dima and R. Lanotte, Distributed Time-Asynchronous Automata, Proceedings of the 4th international conference on Theoretical aspects of computing, ICTAC'07, pp.185-200, 2007.
DOI : 10.1007/978-3-540-75292-9_13

S. [. Daws and . Yovine, Two examples of verification of multirate timed automata with Kronos, Proceedings 16th IEEE Real-Time Systems Symposium, pp.66-75, 1995.
DOI : 10.1109/REAL.1995.495197

A. David and W. Yi, Modelling and analysis of a commercial field bus protocol, Proceedings 12th Euromicro Conference on Real-Time Systems. Euromicro RTS 2000, pp.165-172, 2000.
DOI : 10.1109/EMRTS.2000.854004

U. Fahrenberg, K. G. Larsen, and C. Thrane, A quantitative characterization of weighted Kripke structures in temporal logic, Journal of Computing and Informatics, vol.29, issue.6+, pp.1311-1324, 2010.

M. Fränzle, Analysis of Hybrid Systems: An Ounce of Realism Can Save an Infinity of States, Lecture Notes in Computer Science, vol.1683, pp.126-139, 1999.
DOI : 10.1007/3-540-48168-0_10

A. Thomas and . Henzinger, Two challenges in embedded systems design: Predictability and robustness, Philosophical Transactions of the Royal Society, vol.366, pp.3727-3736, 2008.

A. Thomas, B. Henzinger, C. M. Horowitz, and . Kirsch, Giotto: A timetriggered language for embedded programming, EMSOFT, pp.166-184, 2001.

F. Herbreteau, D. Kini, B. Srivathsan, and I. Walukiewicz, Using nonconvex approximations for efficient analysis of timed automata: Extended version, arXiv ? Computing Research Repository, 2011.
URL : https://hal.archives-ouvertes.fr/inria-00559902

[. Holmer, K. Larsen, and W. Yi, Deciding properties of regular real timed processes, Computer Aided Verification, pp.443-453, 1992.
DOI : 10.1007/3-540-55179-4_41

A. Thomas, Z. Henzinger, A. Manna, and . Pnueli, What good are digital clocks?, Proceedings of the 19th International Colloquium on Automata, Languages and Programming, ICALP '92, pp.545-558, 1992.

A. Thomas, J. Henzinger, and . Raskin, Robust undecidability of timed and hybrid systems, Hybrid Systems: Computation and Control, pp.145-159, 2000.

T. Hune, J. Romijn, M. Stoelinga, and F. Vaandrager, Linear Parametric Model Checking of Timed Automata, Lecture Notes in Computer Science, vol.2031, pp.189-203, 2001.
DOI : 10.1007/3-540-45319-9_14

A. Thomas, J. Henzinger, and . Sifakis, The embedded systems design challenge, Formal Methods, 14th International Symposium on Formal Methods, pp.1-15, 2006.

K. Havelund, A. Skou, K. G. Larsen, and K. Lund, Formal Modeling and Analysis of an Audio/Video Protocol: An Industrial Case Study Using UPPAAL, Proceedings of the 18th IEEE Real-Time Systems Symposium, RTSS '97, p.2, 1997.
DOI : 10.7146/brics.v4i31.18957

R. Jaubert and P. Reynier, Quantitative Robustness Analysis of Flat Timed Automata, Proceedings of the 14th international conference on Foundations, pp.229-244, 2011.
DOI : 10.1007/978-3-642-19805-2_16
URL : https://hal.archives-ouvertes.fr/hal-00534896

[. Kordy, R. Langerak, and J. W. Polderman, Re-verification of a Lip Synchronization Protocol using Robust Reachability, FMA, pp.49-62, 2009.
DOI : 10.4204/EPTCS.20.5

H. Kopetz, Real-Time Systems: Design Principles for Distributed Embedded Applications, 2011.

R. Koymans, Specifying real-time properties with metric temporal logic. Real-Time Systems, pp.255-299, 1990.

P. Kr?ál and R. Pelánek, On Sampled Semantics of Timed Systems, Proc. 25th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'05), pp.310-321
DOI : 10.1007/11590156_25

]. P. Kri00 and . Krishnan, Distributed timed automata, Electronic Notes in Theoretical Computer Science, vol.28, pp.5-21, 2000.

K. G. Larsen, A. Legay, L. Traonouez, and A. Wasowski, Robust Specification of Real Time Components, Formal Modeling and Analysis of Timed Systems, pp.129-144, 2011.
DOI : 10.1007/s00165-005-0067-8
URL : https://hal.archives-ouvertes.fr/hal-01088002

G. Kim, A. Larsen, and . Skou, Bisimulation through probabilistic testing, Proc. 16th Annual ACM Symposium on Principles of Programming Languages, pp.344-352, 1989.

G. Kim, W. Larsen, and . Yi, Time abstracted bisimulation: Implicit specifications and decidability, Mathematical Foundations of Programming Semantics, pp.160-176, 1994.

L. Marvin and . Minsky, Computation: finite and infinite machines, 1967.

J. Ortiz, A. Legay, and P. Schobbens, Distributed Event Clock Automata, Implementation and Application of Automata, pp.250-263, 2011.
DOI : 10.1016/S0019-9958(83)80051-5

J. Ouaknine and J. Worrell, Revisiting digitization, robustness, and decidability for timed automata, 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings., pp.198-207, 2003.
DOI : 10.1109/LICS.2003.1210059

J. Ouaknine and J. Worrell, Universality and Language Inclusion for Open and Closed Timed Automata, Proceedings of the 6th international conference on Hybrid systems: computation and control, HSCC'03, pp.375-388, 2003.
DOI : 10.1007/3-540-36580-X_28

[. Peter, R. Ehlers, and R. Mattmüller, Synthia: Verification and Synthesis for Timed Automata, Computer Aided Verification, pp.649-655, 2011.
DOI : 10.1007/3-540-59042-0_76

A. Puri, Dynamical properties of timed automata. Discrete Event Dynamic Systems, pp.87-113, 2000.

]. F. Ram30 and . Ramsey, On a problem in formal logic, Proc. London Math. Soc. (3), pp.264-286, 1930.

G. Rodriguez-navas, J. Proenza, and H. Hansson, Using UPPAAL to Model and Verify a Clock Synchronization Protocol for the Controller Area Network, 2005 IEEE Conference on Emerging Technologies and Factory Automation, 2005.
DOI : 10.1109/ETFA.2005.1612717

J. Reineke, B. Wachter, S. Thesing, R. Wilhelm, I. Polian et al., A definition and classification of timing anomalies, Proceedings of 6th International Workshop on Worst-Case Execution Time (WCET) Analysis, 2006.

O. Sankur, Model-checking robuste des automates temporisés via les machines à canaux, 2010.

O. Sankur, Untimed Language Preservation in Timed Systems, Proceedings of the 36th International Symposium on Mathematical Foundations of Computer Science (MFCS'11), pp.556-567, 2011.
DOI : 10.1007/978-3-642-22993-0_50

O. Sankur, Shrinktech: A Tool for the Robustness Analysis of Timed Automata, Proceedings of the 25th International Conference on Computer Aided Verification (CAV'13). To appear, 2013.
DOI : 10.1007/978-3-642-39799-8_72

[. Sankur, P. Bouyer, and N. Markey, Shrinking timed automata, Proceedings of the 31st Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'11), volume 13 of LIPIcs Leibniz-Zentrum für Informatik, pp.375-386, 2011.
DOI : 10.1016/j.ic.2014.01.002

O. Sankur, P. Bouyer, N. Markey, and P. Reynier, Robust Controller Synthesis in Timed Automata, 2013.
DOI : 10.1007/978-3-642-40184-8_38

M. Swaminathan, M. Fränzle, and J. Katoen, The Surprising Robustness of (Closed) Timed Automata against Clock-Drift, Fifth IFIP International Conference On Theoretical Computer Science TCS IFIP International Federation for Information Processing, pp.537-553, 2008.
DOI : 10.1007/978-0-387-09680-3_36

A. Stainer, Frequencies in Forgetful Timed Automata, Lecture Notes in Computer Science, vol.7595, pp.236-251, 2012.
DOI : 10.1007/978-3-642-33365-1_17
URL : https://hal.archives-ouvertes.fr/hal-00744081

A. Tarski, A lattice-theoretical fixpoint theorem and its applications, Pacific Journal of Mathematics, vol.5, issue.2, pp.285-309, 1955.
DOI : 10.2140/pjm.1955.5.285

[. Thrane, U. Fahrenberg, and K. G. Larsen, Quantitative analysis of weighted transition systems, The Journal of Logic and Algebraic Programming, vol.79, issue.7, pp.689-703, 2010.
DOI : 10.1016/j.jlap.2010.07.010

S. Tripakis and S. Yovine, Analysis of timed systems using time-abstracting bisimulations. Form, Formal Methods in System Design, vol.18, issue.1, pp.25-68, 2001.
DOI : 10.1023/A:1008734703554

F. Wang, REDLIB for the Formal Verification of Embedded Systems, Second International Symposium on Leveraging Applications of Formal Methods, Verification and Validation (isola 2006), pp.341-346, 2006.
DOI : 10.1109/ISoLA.2006.68